Pagini recente » Cod sursa (job #458287) | Cod sursa (job #298669) | Cod sursa (job #2647308) | Cod sursa (job #1045907) | Cod sursa (job #1529208)
#include<iostream>
#include<fstream>
#define D 500000
using namespace std;
ifstream fin("secventa.in"); ofstream fout("secventa.out");
int n,k;
short x[D+10],a;
int poz[D+10],pi,pf,maxim=-D,p=1,u=1;
int main()
{
cin.sync_with_stdio(false);
int i,r,j;
fin>>n>>k;
fin>>a;
x[p]=a;
poz[p]=1;
for(i=2;i<=n;i++)
{
fin>>a;
//while(p<=u&&x[u]>=a) u--;
x[++u]=a;
poz[u]=i;
if(i-poz[p]+1>k) p++;
if(i>=k&&x[p]>maxim)
{
maxim=x[p];
pf=i;
}
}
fout<<pf-k+1<<" "<<pf<<" "<<maxim<<"\n";
return 0;
}