Pagini recente » Cod sursa (job #224144) | Cod sursa (job #114906) | Cod sursa (job #3124518) | Cod sursa (job #2912784) | Cod sursa (job #12085)
Cod sursa(job #12085)
#include <stdio.h>
#include <iostream>
int sir[510001];
int coada[510001];
int n,i,k,sc,ec;
int bzcm, end, st;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d %d\n", &n, &k);
scanf("%d", &sir[1]);
coada[1] = 1;
sc = 1;
ec = 1;
for ( i = 2; i <= n; i++ )
{
scanf("%d", &sir[i] );
if ( (i-1)- coada[sc] + 1 == k )
{
if ( sir[ coada[sc] ]> bzcm )
{
bzcm = sir[ coada[sc] ];
st = coada[sc];
end = (i-1);
}
sc++;
}
while ( sir[ coada[ec] ] > sir[i] && ec >= sc)
ec--;
ec++;
coada[ec] = i;
}
if ( sir[ coada[sc] ] > bzcm )
{
bzcm = sir[ coada[sc] ];
st = n-k+1;
end = n;
}
printf("%d %d %d\n", st,end,bzcm);
fclose(stdin);
fclose(stdout);
return 0;
}