Cod sursa(job #522930)

Utilizator elfusFlorin Chirica elfus Data 16 ianuarie 2011 18:16:57
Problema Secventa Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.54 kb
#include<stdio.h>
#include<fstream>
#define LMAX 500100

int n,k;
int x[LMAX],q[LMAX];

void read()
{
int i;
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
	in>>x[i];
}

void solve()
{
int p=1,u=0,i,poz,max=poz=-(1<<25);
for(i=1;i<=n;i++)
	{
	while(p<=u && x[i]<=x[q[u]])
		u--;
	q[++u]=i;
	if(q[p]+k==i)
		p++;
	if(i>=k)
		if(x[q[p]]>max)
			max=x[q[p]],poz=i;
	}
printf("%d %d %d",poz-k+1,poz,max);
}

int main()
{
read();
solve();
return 0;
}