Cod sursa(job #1392032)
Utilizator | Data | 18 martie 2015 12:37:05 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque <int> d;
int i,n,v[5000001],k;
long long rez;
int main()
{
f>>n>>k;
for (i=1; i<=n; ++i)
{
f>>v[i];
while (!d.empty() && v[d.back()]>v[i])
d.pop_back();
d.push_back(i);
if (d.front()==i-k) d.pop_front();
if (i>=k) rez+=v[d.front()];
}
g<<rez<<'\n';
return 0;
}