Cod sursa(job #2391681)
Utilizator | Magirescu Tudor Frostfire | Data | 29 martie 2019 09:19:41 |
---|---|---|---|
Problema | Secventa | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k, v[500100], dq[500100], sol = -30100, p1, p2;
int main()
{
f >> n >> k;
for(int i=1; i<=n; i++) f >> v[i];
int st = 1;
int dr = 0;
for(int i=1; i<=n; i++)
{
while(st <= dr && v[i] <= v[dq[dr]]) dr--;
dq[++dr] = i;
if(dq[st] == i-k) st++;
if(i >= k && v[dq[st]] > sol)
{
p1 = i - k + 1;
p2 = i;
sol = v[dq[st]];
}
}
g << p1 << ' ' << p2 << ' ' << sol << '\n';
return 0;
}