Cod sursa(job #2578766)
| Utilizator | Data | 11 martie 2020 16:00:44 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <deque>
using namespace std;
//ifstream cin("text.in"); ofstream cout("text.out");
ifstream cin("deque.in"); ofstream cout("deque.out");
const int LMAX = 5e6 + 10;
int v[LMAX];
deque <int> d;
int main()
{
int n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; ++i)
{
cin >> v[i];
if (i >= k && d.back() == i - k)
d.pop_back();
while (!d.empty() && v[i] <= v[d.front()])
d.pop_front();
d.push_front(i);
if (i >= k)
ans = ans + v[d.back()];
}
cout << ans;
return 0;
}
