Pagini recente » Cod sursa (job #2161459) | Cod sursa (job #2653893) | Cod sursa (job #2577292) | Cod sursa (job #2559903) | Cod sursa (job #709022)
Cod sursa(job #709022)
#include <stdio.h>
#warning sunt putin prost
long a[500002],deq[500002];
long i,n,j,fr,bk,max,maxi,k;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%ld%ld",&n,&k);
fr=1;bk=0;max=-999999999;
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
while((fr<=bk)&&(a[i]<=a[deq[bk]])){bk--;}
deq[++bk]=i;
if(deq[fr]==i-k){fr++;}
if(i>=k){if(a[deq[fr]]>max){max=a[deq[fr]];maxi=i;}}
}
printf("%ld %ld %ld",maxi-k+1,maxi,max);
return 0;
}