Cod sursa(job #3149948)
Utilizator | Data | 13 septembrie 2023 20:13:41 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <deque>
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int main()
{
deque<pair<int,int>> d;
int a;
int k;
int n;
int s=0;
fin >> n >> k;
for (int i=0; i<n; ++i) {
fin >> a;
while (!d.empty() && d.back().first>a) {
d.pop_back();
}
d.emplace_back(a,i);
if(!d.empty() && d.front().second==i-k) {
d.pop_front();
}
if(!d.empty()&&i>=k-1) {
s=s+d.front().first;
}
}
fout << s;
return 0;
}