Pagini recente » Cod sursa (job #3268334) | Cod sursa (job #2395935) | Cod sursa (job #1109338) | Cod sursa (job #3150103) | Cod sursa (job #1458452)
#include <stdio.h>
#include <deque>
#define MAX_N 500000
#define INF 30001
std::deque <int> d;
short v[MAX_N];
int main(void) {
FILE *f = fopen("secventa.in", "r");
int n, k;
int maxPos;
short maxValue;
fscanf(f, "%d%d", &n, &k);
for (register int i = 0; i + 1 < k; i++) {
fscanf(f, "%hd", &v[i]);
while (!d.empty() && v[d.back()] >= v[i]) {
d.pop_back();
}
d.push_back(i);
}
maxPos = 0;
maxValue = -INF;
for (register int i = k - 1; i < n; i++) {
fscanf(f, "%hd", &v[i]);
while (!d.empty() && v[d.back()] >= v[i]) {
d.pop_back();
}
d.push_back(i);
if (d.front() <= i - k) {
d.pop_front();
}
if (v[d.front()] > maxValue) {
maxPos = i;
maxValue = v[d.front()];
}
}
fclose(f);
f = fopen("secventa.out", "w");
fprintf(f, "%d %d %d\n", maxPos - k + 2, maxPos + 1, maxValue);
fclose(f);
return 0;
}