Pagini recente » Cod sursa (job #2652353) | Cod sursa (job #3289279) | Cod sursa (job #2990611) | Cod sursa (job #2050309) | Cod sursa (job #2656320)
#include <cstdio>
#include <deque>
#include <cctype>
const int NMAX = 500005;
const int BUFFMAX = 7000000;
int n, k, a[NMAX];
void read() {
scanf("%d %d", &n, &k);
getchar();
char line[BUFFMAX];
fgets(line, BUFFMAX, stdin);
int i = 0, j = 1, sign;
while (i < BUFFMAX) {
while (!isdigit(line[i]) && line[i] != '-')
i++;
sign = line[i] == '-' ? -1 : 1;
if (sign == -1) i++;
int num = 0;
while (isdigit(line[i]))
num = num * 10 + (line[i++] - '0');
a[j++] = sign * num;
}
}
int main() {
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
read();
std::deque<int> d;
int base_max = -50000;
std::pair<int, int> range;
for (int i = 1; i <= n; i++) {
if (d.front() == i - k)
d.pop_front();
while (!d.empty() && a[d.back()] >= a[i])
d.pop_back();
d.push_back(i);
while (!d.empty() && d.front() <= i - k)
d.pop_front();
if (i >= k && a[d.front()] > base_max) {
base_max = a[d.front()];
range = {d.front(), d.back()};
range = {i - k + 1, i};
}
}
printf("%d %d %d\n", range.first, range.second, base_max);
return 0;
}