Pagini recente » Cod sursa (job #1268943) | Cod sursa (job #1313545) | Cod sursa (job #1665861) | Cod sursa (job #2378846) | Cod sursa (job #3128097)
#include <iostream>
#include <fstream>
using namespace std;
int v[5000001], temp[5000001];
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 = 1; i <= n; i++)
f >> v[i];
for (int i = 1; i <= n; i++) {
while (st <= dr && v[i] <= v[temp[dr]]) {
dr=dr-1;
}
dr=dr+1;
temp[dr] = i;
if (k - i < 1 - temp[st]) {
st=st+1;
}
if (i >= k) {
suma = suma + v[temp[st]];
}
}
g << suma;
f.close();
g.close();
return 0;
}