Cod sursa(job #2331747)
Utilizator | Petruta George-Calin GeorgeCalin | Data | 29 ianuarie 2019 21:25:40 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <deque>
#define nmax 5000006
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque <int> d;
long long v[nmax];
int main()
{
int n,sum=0,k;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
while(!d.empty()&&v[i]<=v[d.back()])
d.pop_back();
d.push_back(i);
if(d.front()<=i-k)
d.pop_front();
if(i>=k)
sum+=v[d.front()];
}
fout<<sum;
return 0;
}