Pagini recente » Cod sursa (job #1213267) | Cod sursa (job #3162633) | Cod sursa (job #2840126) | Cod sursa (job #2596216) | Cod sursa (job #2721009)
#include <bits/stdc++.h>
#define maxn 5000010
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int sir[maxn];
int main() {
int n, k, suma = 0;
deque <int> coada;
fin >> n >> k;
for(int i = 1; i <= n; ++i)
fin >> sir[i];
for(int i = 1; i <= n; ++i) {
while(!coada.empty() && sir[i] <= sir[coada.back()])
coada.pop_back();
coada.emplace_back(i);
if(coada.front() == i - k)
coada.pop_front();
if(i >= k)
suma += sir[coada.front()];
}
fout << suma;
}