Pagini recente » Cod sursa (job #2862443) | Cod sursa (job #2104713) | Cod sursa (job #2000323) | Cod sursa (job #2314049) | Cod sursa (job #1804456)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,i,vf,bz,maxim,dq[1000000],inc,sf,nr,a[500010];
int main()
{
fin>>n>>k;
maxim=-2000000000;
vf=-1;
for (i=1; i<=n; i++)
{
fin>>a[i];
while (vf>=bz&&a[dq[vf]]>a[i])
vf--;
dq[++vf]=i;
if (dq[bz]<=i-k)
bz++;
if (a[dq[bz]]>maxim)
{
maxim=a[dq[bz]];
nr=dq[bz];
}
}
sf=nr+k-1;
inc=nr;
while (inc>1&&a[inc-1]>=a[nr])
inc--;
fout<<inc<<' '<<sf<<' '<<maxim;
return 0;
}