Cod sursa(job #1968980)
Utilizator | Huhurez Marius trutruvasilica | Data | 18 aprilie 2017 07:05:11 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque<int>Q;
int v[5000010];
int main()
{
int n,k,sum=0;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
while(Q.size() && i-Q.front()>=k) Q.pop_front();
while(Q.size() && v[i]<=v[Q.back()]) Q.pop_back();
Q.push_back(i);
if(i>=k)
{
sum+=v[Q.front()];
}
}
fout<<sum;
}