Cod sursa(job #3330402)
| Utilizator | Data | 19 decembrie 2025 14:22:25 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <deque>
#define int long long
using namespace std;
ifstream cin ("deque.in");
ofstream cout ("deque.out");
deque<int> q;
int v[5000005];
int32_t main(){
int n,k,sum=0;
cin>>n>>k;
for (int i=1; i<=n; i++) {
cin>>v[i];
while (!q.empty() && v[i]<v[q.back()]) {
q.pop_back();
}
q.push_back(i);
if (i>=k) {
while (q.front()<i-k+1){
q.pop_front();
}
sum+=v[q.front()];
}
}
cout<<sum;
}