Pagini recente » Cod sursa (job #3289307) | Cod sursa (job #24028) | Monitorul de evaluare | Cod sursa (job #2710550) | Cod sursa (job #542166)
Cod sursa(job #542166)
# include <fstream>
using namespace std;
ifstream f("secventa.in"); ofstream g("secventa.out");
int k, n, i, front = 1, back, deque[500001], a[500001], baza = -30001, vi = -1, vf = -1;
int main ()
{ f >> n >> k; for (i = 1; i <= n; ++i) f >> a[i];
for (i = 1; i <= n; ++i)
{ while (front <= back && a[i] <= a [ deque [ back ]]) back --;
deque [ ++ back ] = i;
if (deque [ front ] == i - k) front ++;
if (i >= k && a [ deque [ front ]] > baza) {baza = a [ deque [ front ]]; vi = (vf = i) - k + 1;}
}
g << vi << ' ' << vf << ' ' << baza << '\n'; return 0;
}