Pagini recente » Cod sursa (job #2921273) | Cod sursa (job #2347917) | Cod sursa (job #2857474) | Cod sursa (job #2973692) | Cod sursa (job #2961233)
#include <bits/stdc++.h>
#define NMAX 15
using namespace std;
int v[NMAX];
int main()
{
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> v[i];
long long ans = 0;
deque<int> dq;
for (int i = 1; i <= n; ++i) {
while (!dq.empty() && v[i] <= v[dq.back()])
dq.pop_back();
dq.push_back(i);
while (!dq.empty() && dq.front() <= i - k)
dq.pop_front();
if (i >= k)
ans += v[dq.front()];
}
cout << ans << '\n';
return 0;
}