Cod sursa(job #338083)

Utilizator pykhNeagoe Alexandru pykh Data 5 august 2009 12:57:25
Problema Secventa Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.59 kb
#include<stdio.h>
#define maxN 500005
const char in[]="secventa.in";
const char out[]="secventa.out";
int v[maxN], N, K, i, deque[maxN], front=1, back=0, max=-maxN, ipoz;

int main()
	{
		freopen(in,"r",stdin);
		scanf("%d %d", &N, &K);
		for(i=1;i <= N; ++i)
			scanf("%d ", &v[i]);
		for(i=1;i<=N;++i)
			{
			while(front<=back && v[i]<=v[deque[back]])--back;
			deque[++back]=i;
			if(deque[front]==i-K)++front;
			if(i>=K)if(v[deque[front]]>max){max=v[deque[front]];ipoz=deque[front];}
		}	
		freopen(out,"w",stdout);
	printf("%d %d %d \n", ipoz, ipoz+K-1, max);
return 0;
}