Pagini recente » Cod sursa (job #2920764) | Cod sursa (job #691092) | Cod sursa (job #924464) | Cod sursa (job #2968044) | Cod sursa (job #12791)
Cod sursa(job #12791)
#include <stdio.h>
#include <iostream>
using namespace std;
int sir[500001];
int coada[500001];
char buf[2097152];
int n,i,k,sc,ec;
int bzcm=-320000, 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 )
++sc;
while ( sir[ coada[ec] ] > sir[i] && ec >= sc)
--ec;
++ec;
coada[ec] = i;
if ( i > (k-1) )
if ( sir[ coada[sc] ] > bzcm )
{
bzcm = sir[ coada[sc] ];
st = i-k+1;
end = i;
}
}
printf("%d %d %d\n", st,end,bzcm);
return 0;
}