Pagini recente » Cod sursa (job #2668757) | Cod sursa (job #1691419) | Cod sursa (job #1509231) | Cod sursa (job #182358) | Cod sursa (job #2730693)
#include <bits/stdc++.h>
using namespace std;
#define NMAX 5000001
ifstream f("deque.in");
ofstream o("deque.out");
int v[NMAX], deq[NMAX];
int main() {
int n, k, start = 0, end = -1, i, suma = 0;
f >> n >> k;
for (i = 0; i < n; i++)
f >> v[i];
for (i = 0; i < n; i++) {
while (start <= end && v[i] <= v[deq[end]])
end--;
deq[++end] = i;
if (deq[start] == i - k)
start++;
if (i >= k - 1)
suma += v[deq[start]];
}
o << suma;
f.close();
o.close();
return 0;
}