Cod sursa(job #3315697)
| Utilizator | Data | 15 octombrie 2025 19:01:36 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
int v[50000005];
int main()
{
ifstream cin("deque.in");
ofstream cout("deque.out");
int n, k; cin >> n >> k;
for (int i = 1; i <= n; i ++)
{
cin >> v[i];
}
deque<int> dq;
int sum = 0;
for (int i = 1; i <= n; i ++)
{
while (!dq.empty() && v[dq.back()] >= v[i])
dq.pop_back();
dq.push_back(i);
if (dq.front() <= i - k)
dq.pop_front();
if (i >= k)
sum += v[dq.front()];
}
cout << sum;
}