Pagini recente » Cod sursa (job #2091475) | Cod sursa (job #668117) | Cod sursa (job #3175197) | Cod sursa (job #2335926) | Cod sursa (job #253320)
Cod sursa(job #253320)
#include<stdio.h>
long n,k,i,a[500005],p[500005],st,dr,s,m;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%ld%ld",&n,&k);
st=1;dr=0;
s=-1000000000;
for(i=1;i<=n;++i)
{scanf("%ld",&a[i]);
while(a[p[dr]]>=a[i]&&dr>=st)--dr;
p[++dr]=i;
if(i>=k)
{if(p[st]<=i-k)++st;
if(a[p[st]]>s){s=a[p[st]];m=i;}}}
printf("%ld %ld %ld\n",m-k+1,m,s);
return 0;
}