Cod sursa(job #522933)

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

ifstream fin("secventa.in");
oftream fout("secventa.out");

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

using namespace std;

void read()
{
int i;
//freopen("secventa.in","r",stdin);
//freopen("secventa.out","w",stdout);
//scanf("%d%d",&n,&k);
fin>>n>>k;
for(i=1;i<=n;i++)
	fin>>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);
fout<<poz-k+1<<" "<<poz<<" "<<max;
}

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