Cod sursa(job #2718204)
Utilizator | Radu Mihai Gheorghe radugheo | Data | 8 martie 2021 16:17:50 |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream fin ("deque.in");
ofstream fout ("deque.out");
int n, i, sum, k;
int v[5000005];
deque <int> d;
int main()
{
fin >> n >> k;
for (i=1; i<=n; i++){
fin >> v[i];
}
d.push_back(1);
for (i=2; i<=n; i++){
while (v[i] <= v[d.back()] && !d.empty()){
d.pop_back();
}
d.push_back(i);
while (d.front() == i - k && !d.empty()){
d.pop_front();
}
if (i >= k){
sum += v[d.front()];
}
}
fout << sum;
return 0;
}