Cod sursa(job #3286530)
| Utilizator | Data | 14 martie 2025 12:29:27 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int n, k, s;
vector<int> v;
deque<int> dq;
int main()
{
cin >> n >> k;
v.resize(n+1);
for(int i=1; i<=n; i++)
cin >> v[i];
for(int i=1; i<=n; i++)
{
while(!dq.empty() && v[dq.front()] >= v[i])
dq.pop_front();
dq.push_front(i);
if(dq.back() < i - k + 1)
dq.pop_back();
if(i >= k)
s += v[dq.back()];
}
cout << s;
return 0;
}
