Pagini recente » Cod sursa (job #1109884) | Cod sursa (job #1518555) | Cod sursa (job #2691028) | Cod sursa (job #3172342) | Cod sursa (job #3247561)
#include <fstream>
#include <deque>
using namespace std;
ifstream cin ("deque.in");
ofstream cout ("deque.out");
int v[5000005];
deque <int> dq;
int main() {
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> v[i];
int ans = 0;
for(int i = 1; i <= n; i++) {
while(!dq.empty() && v[dq.back()] > v[i])
dq.pop_back();
while(!dq.empty() && dq.front() <= i-k)
dq.pop_front();
dq.push_back(i);
if(i >= k)
ans += v[dq.front()];
}
cout << ans;
}