Pagini recente » Cod sursa (job #2246158) | Cod sursa (job #1178884) | Cod sursa (job #1685766) | Cod sursa (job #982718) | Cod sursa (job #1092152)
#include <cstdio>
using namespace std;
int v[500010],deq[500010],i,n,k,st,dr,max,a;
int main()
{
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++) scanf("%d",&v[i]);
st=1;dr=0;
max=-300000;
for(i=1;i<=n;i++)
{
while(st<=dr && v[i]<=v[deq[dr]]) dr--;
deq[++dr]=i;
if(deq[st]==i-k) st++;
if(i>=k && v[deq[st]]>max){max=v[deq[st]];a=i;}
}
printf("%d %d %d",a-k+1,a,max);
return 0;;
}