Pagini recente » Cod sursa (job #913802) | Cod sursa (job #1377858) | Cod sursa (job #1892818) | Cod sursa (job #2582358) | Cod sursa (job #1688863)
#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream intrare("deque.in");
ofstream iesire("deque.out");
int n, k;
vector<int> vec;
long long rez;
deque<int>Q;
int main() {
ios::sync_with_stdio(false);
intrare >> n >> k;
vec = vector<int>(n);
for (int i = 0; i < n; i++) intrare >> vec[i];
Q.push_back(0);
for (int i = 1; i < n; i++) {
if (!(i - k < 0)) rez += vec[Q.front()];
if (Q.front() <= i - k) {
Q.pop_front();
}
if (Q.empty()) {
Q.push_back(i);
rez += vec[Q.back()];
continue;
}
while (vec[Q.back()] >= vec[i]) {
Q.pop_back();
if (Q.empty()) break;
}
Q.push_back(i);
}
rez += vec[Q.front()];
iesire << rez;
}