Cod sursa(job #3162548)
Utilizator | Despa Fabian Stefan MrPuzzle | Data | 29 octombrie 2023 13:20:40 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <deque>
#define DIM 5000000
using namespace std;
//ifstream f("in.in");
//ofstream g("out.out");
ifstream f("deque.in");
ofstream g("deque.out");
int sol=0,v[DIM+5],n,k;
deque<int> q;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++){
f>>v[i];
while(!q.empty() && q.front() < i-k+1){
q.pop_front();
}
while(!q.empty() && v[q.back()]>v[i]){
q.pop_back();
}
q.push_back(i);
if(i>=k){
sol+=v[q.front()];
}
}
g<<sol;
return 0;
}