Pagini recente » Cod sursa (job #2391199) | Cod sursa (job #257749) | Cod sursa (job #2599555) | Cod sursa (job #21627) | Cod sursa (job #2699384)
#include <fstream>
#include <deque>
#include <vector>
#include <string>
#include <iomanip>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int main() {
int n, k;
cin >> n >> k;
deque<long long> dq;
vector<int> a(n + 1);
long long suma = 0;
for (int i = 1; i <= n; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i) {
while (!dq.empty() && dq.front() > a[i]) {
dq.pop_front();
}
dq.push_front(a[i]);
if (i >= k) {
suma += dq.back();
if (dq.back() == a[i - k + 1]) {
dq.pop_back();
}
}
}
cout << suma;
}