Cod sursa(job #2355910)
Utilizator | Data | 26 februarie 2019 13:16:44 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <deque>
using namespace std;
typedef unsigned int uint;
ifstream fin("deque.in");
ofstream fout("deque.out");
int main()
{
uint n,k;
fin >> n >> k;
deque<uint> dq;
int v[n], sum = 0;
for (uint i = 0; i < n; ++i)
{
fin >> v[i];
while (!dq.empty() && v[i] <= v[dq.back()])
dq.pop_back();
dq.push_back(i);
if (i + 1 >= k)
{
if (dq.front() + k == i)
dq.pop_front();
sum += v[dq.front()];
}
}
fout << sum;
}