Pagini recente » Cod sursa (job #2799458) | Cod sursa (job #465990) | Cod sursa (job #1253894) | Cod sursa (job #798347) | Cod sursa (job #2409613)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
struct xy { int x, y; };
const int maxn = 5e5+5;
xy q[maxn]; int k, p;
int n, m, i, x;
xy best;
int v[maxn];
bool operator > (xy a, xy b) { return a.x > b.x; }
int a, b, len;
int main()
{
best = {-0x3f3f3f3f, 0};
f >> n >> m;
for(i = 1; i <= n; i ++) {
f >> x; v[i] = x;
if(p == 0 || q[p].y == i - m) { ++ p; }
while(k >= p && x < q[k].x) {
-- k;
}
q[++k] = {x, i};
if(q[p] > best) { best = q[p]; }
}
len = 1; a = b = best.y;
for(i = best.y - 1; i >= 1; i --) {
if(v[i] > best.x) { len ++; } else { a = i + 1; break; }
}
for(i = best.y + 1; i <= n && len < m; i ++) {
++len; b = i;
}
g << a << ' ' << b << ' ' << best.x << '\n';
f.close(); g.close();
return 0;
}