Pagini recente » Cod sursa (job #3176241) | Cod sursa (job #1039139) | Cod sursa (job #1957648) | Cod sursa (job #350705) | Cod sursa (job #2624636)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int main() {
int n, k, v[100001], deque[100001], p = 1, q = 0, i, suma = 0;
fin >> n >> k;
for(i = 1; i <= n; ++i)
fin >> v[i];
for(i = 1; i <= n; ++i) {
while (p <= q && v[i] < v[deque[q]])
q--;
deque[++q] = i;
if (deque[p] == i - k)
p++;
if (i >= k)
suma += v[deque[p]];
}
fout << suma;
return 0;
}