Cod sursa(job #2683661)
| Utilizator | Data | 11 decembrie 2020 21:35:41 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque <int> d;
int n,k,v[5000001],sum;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
for(int i=1;i<=n;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)
{
sum+=v[d.front()];
}
}
fout<<sum;
}
