Pagini recente » Cod sursa (job #1787085) | Cod sursa (job #706740) | Cod sursa (job #1083498) | Rating matei tudor (MAVA-PRODUCTIONS) | Cod sursa (job #2045756)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int v[5000000], d[5000000];
int main()
{
int n, k, i, st, dr, mx, a, b;
f >> n >> k;
dr = -1;
mx = -30005;
for ( i = st = 0; i < n; i++ ) {
f >> v[i];
if ( st <= dr && d[st] == i-k ) {
st++;
}
while ( st <= dr && v[i] <= v[d[dr]]) {
dr--;
}
d[++dr] = i;
if ( i >= k-1 && v[d[st]] > mx ) {
mx = v[d[st]];
a = i+1;
b = i-k+2;
}
}
g << b << " "<< a << " "<< mx;
f.close();
g.close();
return 0;
}