Pagini recente » Cod sursa (job #1145859) | Cod sursa (job #36564) | Cod sursa (job #1505382) | Cod sursa (job #1189514) | Cod sursa (job #2366955)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k, v[500100], Deque[500100], sol = -50000, st, dr, p1, p2;
int main()
{
f >> n >> k;
for(int i=1; i<=n; i++) f >> v[i];
st = 1;
dr = 0;
for(int i=1; i<=n; i++)
{
if(Deque[st] == i-k) st++;
while(st <= dr && v[i] <= v[Deque[dr]]) dr--;
Deque[++dr] = i;
if(i >= k && v[Deque[st]] > sol)
{
sol = v[Deque[st]];
p1 = Deque[st];
p2 = Deque[st] + k - 1;
}
}
g << p1 << ' ' << p2 << ' ' << sol << '\n';
return 0;
}