Pagini recente » Cod sursa (job #478446) | Cod sursa (job #2473127) | Cod sursa (job #1550241) | Cod sursa (job #1923118) | Cod sursa (job #3128094)
#include <iostream>
#include <fstream>
using namespace std;
int v[5000001], temp[5000000];
int main() {
ifstream f("deque.in");
ofstream g("deque.out");
int n, k, st = 0, dr = 0;
f >> n >> k;
float suma = 0;
for (int i = 0; i < n; i++)
f >> v[i];
for (int i = 0; i < n; i++) {
while (st <= dr && v[i] <= v[temp[dr]]) {
--dr;
}
++dr;
temp[dr] = i;
if (k - i < 1 - temp[st]) {
++st;
}
if (i >= k - 1) {
suma = suma + v[temp[st]];
}
}
g << suma;
f.close();
g.close();
return 0;
}