Pagini recente » Cod sursa (job #450655) | Cod sursa (job #3177106) | Cod sursa (job #2812665) | Cod sursa (job #2408634) | Cod sursa (job #1316256)
#include <fstream>
#include <cstdio>
using namespace std;
int v[5000005],d[5000005];
long long n,k,i,front,back,S,MAX,l,fr;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d",&n);
scanf("%d",&k);
MAX=-9999999;
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
front=1;back=1;
for(i=1;i<=n;i++)
{
while(front<=back&&v[i]<=v[d[back]])
back--;
back++;
d[back]=i;
if(d[front]==i-k)
front++;
if(i>=k && v[d[front]]>MAX)
{
MAX=v[d[front]];
l=i;
fr=i-k+1;
}
}
printf("%d ",fr);
printf("%d ",l);
printf("%d ",MAX);
return 0;
}