Pagini recente » Cod sursa (job #440679) | Cod sursa (job #1232635) | Cod sursa (job #2819977) | Cod sursa (job #2092348) | Cod sursa (job #813126)
Cod sursa(job #813126)
#include<cstdio>
using namespace std;
int v[5000001],deq[5000001];
int main()
{
long long n,k,p,u;
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%lld %lld",&n,&k);
p=1;
u=0;
for (i=1;i<=n;++i)
scanf("%d",&v[i]);
for (i=1;i<=n;++i)
{
while ((v[i]<=v[deq[u]])&&(p<=u))
u--;
u++;
deq[u]=i;
if (i-deq[i]>=k) p++;
if (i>=k)
if (max<v[deq[p]])
{ max=v[deq[p]];
poz=i;
}
printf("%d %d %d",poz-k+1,poz,max);
}
}