Cod sursa(job #3214004)
Utilizator | Data | 13 martie 2024 17:52:06 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n, k, sum = 0, a[5000006];
deque <int> d;
int main()
{
int i, x;
fin >> n >> k;
for (i = 1; i <= n; i++)
{
fin >> a[i];
x = a[i];
while (!d.empty() and a[d.back()] >= x)
d.pop_back();
d.push_back(i);
if (i >= k)
{
if (d.front() == i - k)
d.pop_front();
sum += a[d.front()];
}
}
fout << sum << "\n";
return 0;
}