Cod sursa(job #2833220)
| Utilizator | Data | 14 ianuarie 2022 22:09:07 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
#define DIM 500000
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque<int> d;
int v[DIM], n, i, k;
long long s;
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(!d.empty()&&v[i]<=v[d.back()]){
d.pop_back();
}
d.push_back(i);
if(i-d.front()==k){
d.pop_front();
}
if(i>=k){
s+=v[d.front()];
}
}
fout<<s;
return 0;
}
