Pagini recente » Cod sursa (job #558969) | Cod sursa (job #521954) | Cod sursa (job #2174669) | Cod sursa (job #927932) | Cod sursa (job #585086)
Cod sursa(job #585086)
#include <cstdio>
using namespace std;
int q[500001],v[500001],k,n;
int main()
{
int l=1,r=0,i,sol=-30001,x;
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]);
for (i=1;i<=n;++i)
{
while (v[q[r]]>=v[i]&&r>=l) --r;
q[++r]=i;
if (q[l]==i-k) ++l;
if ((i>=k)&&(v[q[l]]>sol)) sol=v[q[l]],x=i;
}
printf("%d %d %d\n",x-k+1,x,sol);
return 0;
}