Cod sursa(job #1630849)
Utilizator | Data | 5 martie 2016 11:40:44 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
int n, k, i, v[5000001], sum;
deque <int> d;
ifstream f("deque.in");
ofstream g("deque.out");
int main()
{f>>n>>k;
for(i=1; i<=n; ++i) f>>v[i];
for(i=1; i<=n; ++i)
{
while(d.size() && v[d.back()]>=v[i]) d.pop_back();
d.push_back(i);
//cout<<v[d.front()]<<" ";
if(d.front()==i-k)
{sum=sum+v[d.front()];
d.pop_front();}
}
g<<sum;
g.close();
f.close();
return 0;
}