Pagini recente » Clasament moisil1 | Borderou de evaluare (job #2688830) | Clasament easy_oji_x | Cod sursa (job #623375) | Cod sursa (job #723232)
Cod sursa(job #723232)
#include <stdio.h>
#define N 5000001
int data[N];
int queue[N];
int back, front;
long long sum = 0;
int n, k;
int i;
int main() {
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
back = 0; front = 1;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
for (i = 0; i < n; i++) {
while (front <= back && data[i] <= data[queue[back]]) back--;
queue[++back] = i;
if (queue[front] == i - k) front++;
if (i >= k - 1) {
sum += data[queue[front]];
}
}
printf("%lld\n", sum);
return 0;
}