Cod sursa(job #3324296)
| Utilizator | Data | 21 noiembrie 2025 22:25:32 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 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;
vector<int> v;
int32_t main()
{
cin >> n >> k;
v.resize(n + 5);
for(int i = 1; i <= n; i++)
cin >> v[i];
deque<int> dq;
int ans = 0;
for(int i = 1; i <= n; i++)
{
while(!dq.empty() && v[dq.front()] >= v[i])
dq.pop_front();
dq.push_front(i);
if(i - k + 1 > dq.back())
dq.pop_back();
if(i >= k)
ans += v[dq.back()];
}
cout << ans;
return 0;
}
