Cod sursa(job #3156491)
Utilizator | Data | 11 octombrie 2023 17:44:57 | |
---|---|---|---|
Problema | Deque | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#define N 5000001
#include <deque>
std::ifstream fin("deque.in");
std::ofstream fout("deque.out");
int n, k, arr[N];
std::deque<int> D;
int main(){
fin >> n >> k;
for(int i = 1; i <= n; i++){
fin >> arr[i];
}
long long int sum = 0;
for(int i = 1; i <= n; i++){
while(!D.empty() && arr[i] <= D.back()){
D.pop_back();
}
D.push_back(arr[i]);
if(i - k >= 1 && D.front() == arr[i - k]){
D.pop_front();
}
if(i - k >= 0)
sum += D.front();
}
fout << sum ;
}