Cod sursa(job #3162817)
Utilizator | Data | 29 octombrie 2023 23:33:05 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 5e6+2;
int n,k,v[NMAX];
deque<int> dq;
ifstream fin("deque.in");
ofstream fout("deque.out");
int main()
{
fin >> n >> k;
for(int i = 1; i <= n; i++){
fin >> v[i];
}
int ans = 0;
for(int i = 1; i <= n; i++){
while(!dq.empty() && v[dq.front()] > v[i]){
dq.pop_front();
}
dq.push_front(i);
while(i-dq.back()+1 > k){
dq.pop_back();
}
if(i >= k){
ans += v[dq.back()];
}
}
fout << ans;
return 0;
}