Pagini recente » Cod sursa (job #3316136) | Cod sursa (job #3340863) | Borderou de evaluare (job #3351125) | Cod sursa (job #2823116) | Cod sursa (job #3315696)
#include <bits/stdc++.h>
using namespace std;
int v[100005];
int main()
{
ifstream cin("deque.in");
ofstream cout("deque.out");
int n, k; cin >> n >> k;
for (int i = 1; i <= n; i ++)
{
cin >> v[i];
}
deque<int> dq;
int sum = 0;
for (int i = 1; i <= n; i ++)
{
while (!dq.empty() && v[dq.back()] >= v[i])
dq.pop_back();
dq.push_back(i);
if (dq.front() <= i - k)
dq.pop_front();
if (i >= k)
sum += v[dq.front()];
}
cout << sum;
}