Cod sursa(job #2045753)
Utilizator | Andrei Roceanu Andrei_R | Data | 22 octombrie 2017 20:14:37 |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#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;
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]];
}
}
g << mx;
f.close();
g.close();
return 0;
}