Pagini recente » Cod sursa (job #2790668) | Cod sursa (job #2441151) | Cod sursa (job #432665) | Cod sursa (job #1548028) | Cod sursa (job #29427)
Cod sursa(job #29427)
#include <stdio.h>
const int maxn=500010;
int n,k,i,j,a[maxn],b[maxn],c[maxn],x,poz,p,inc;
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 ",&a[i]);
}
b[1]=a[1];
inc=1;
c[1]=1;
poz=1;
p=1;
for (i=2;i<=n;++i)
{
if (i-inc==k)
{
inc++;
}
if (c[p]<inc) p++;
if (a[i]<b[poz])
{
b[poz]=a[i];
c[poz]=i;
}
else
{
poz++;
b[poz]=a[i];
c[poz]=i;
}
}
printf("%d %d %d",inc,c[poz],b[p]);
return 0;
}