Pagini recente » Cod sursa (job #56961) | Cod sursa (job #524566) | Cod sursa (job #2359637) | Cod sursa (job #2337808) | Cod sursa (job #312189)
Cod sursa(job #312189)
#include <stdio.h>
long st,dr,i,n,k,v[500010],a[500010],x,y,max;
int main()
{freopen("deque.in","r",stdin);freopen("deque.out","w",stdout);
st=1;dr=0;
scanf("%ld%ld",&n,&k);
for(i=1;i<=n;i++)
{scanf("%ld",&a[i]);
while(st<=dr&&a[v[dr]]>=a[i])dr--;
dr++;v[dr]=i;
if(v[st]==i-k)st++;
if(a[d[st]]>max){max=a[d[st]];
x=i-k+1;
y=i;
}
}
printf("%ld %ld %ld",x,y,max);
fclose(stdin);fclose(stdout);
return 0;
}