Pagini recente » Cod sursa (job #2628812) | Cod sursa (job #1812474) | Cod sursa (job #842465) | Cod sursa (job #140196) | Cod sursa (job #1505000)
#include <iostream>
#include <fstream>
#define nmax 500005
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int dq[nmax],poz[nmax];
int main()
{long in,sf,i,x,maxim,inc,n,k,j;
fin>>n>>k;
maxim=-30999;inc=0;
sf=-1;in=0;
for(i=1;i<=n;i++)
{fin>>x;
while(sf>=in && x<dq[sf])sf--;
dq[++sf]=x;
poz[sf] =i;
if(i>=k)
if(dq[in]>maxim)
{maxim=dq[in];
inc=poz[sf]-k+1;}
if(i-poz[in] >= k-1)in++;
}
fout<<inc<<' '<<inc+k-1<<' '<<maxim;
}