Pagini recente » Cod sursa (job #567635) | Cod sursa (job #673858) | Cod sursa (job #754426) | Cod sursa (job #2934754) | Cod sursa (job #1454320)
#include <bits/stdc++.h>
int x[500001], q[500001];
int main() {
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", &x[i]);
int p = 1, u = 0, res = -33333, ind;
for (int i = 1; i <= n; ++i) {
while (p <= u && x[i] < x[q[u]])
--u;
q[++u] = i;
if (q[p] + k == i)
++p;
if (x[q[p]] > res && i >= k) {
res = x[q[p]];
ind = i;
}
}
printf("%d %d %d", ind - k + 1, ind, res);
return 0;
}