Pagini recente » Cod sursa (job #866530) | Cod sursa (job #2492478) | Cod sursa (job #1920660) | Cod sursa (job #2882228) | Cod sursa (job #253304)
Cod sursa(job #253304)
#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);
for(i=1;i<=n;++i)
scanf("%ld",&a[i]);
st=1;
dr=0;
s=-1000000000;
for(i=1;i<=n;++i)
{while(a[p[dr]]>=a[i]&&dr>=st)--dr;
p[++dr]=i;
if(p[st]<=i-k)++st;
if(i>=k)if(a[p[st]]>s){s=a[p[st]];m=i;}}
printf("%ld %ld %ld\n",m-k+1,m,s);
return 0;
}