Cod sursa(job #1596089)
Utilizator | Neghina Dragos dragos231456 | Data | 10 februarie 2016 19:46:27 |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
deque<int> d,p;
int main()
{
long long n,k,s=0,x;
ifstream f("deque.in");
ofstream g("deque.out");
f>>n;
f>>k;
for(int i=1;i<=n;++i)
{
f>>x;
if(!d.empty() && p.front()<=i-k)
{
d.pop_front();
p.pop_front();
}
while(!d.empty()&&d.back()>=x)
{
d.pop_back();
p.pop_back();
}
p.push_back(i);
d.push_back(x);
if(i>=k) s=s+d.front();
}
g<<s;
f.close();
g.close();
return 0;
}