Cod sursa(job #1053086)
Utilizator | Rustin Alexandru RAlexz | Data | 12 decembrie 2013 10:29:21 |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
std::deque <int> d;
int v[500001],n,k;
long long suma;
int main()
{
int i;
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
while(d.size() && v[i]<=v[d.back()])
d.pop_back();
d.push_back(i);
if(d.front()==i-k) d.pop_front();
if(i>=k) suma+=v[d.front()];
}
g<<suma;
return 0;
}