Pagini recente » Cod sursa (job #283592) | Cod sursa (job #3348419) | Cod sursa (job #1909262) | Cod sursa (job #3312469) | Cod sursa (job #3306017)
#include <bits/stdc++.h>
using namespace std;
int v[5000005];
deque<int>q;
int main()
{
ifstream cin("deque.in");
ofstream cout("deque.out");
int n,k;
cin>>n>>k;
for(int i=1; i<=n; i++)
cin>>v[i];
for(int i=1; i<k; i++)
{
while(!q.empty() && v[i]<v[q.back()])
q.pop_back();
q.push_back(i);
}
long long s=0;
for(int i=k; i<=n; i++)
{
while(!q.empty() && v[i]<v[q.back()])
q.pop_back();
q.push_back(i);
while(!q.empty() && i-q.front()>=k)
q.pop_front();
if(!q.empty())
s+=v[q.front()];
}
cout<<s;
return 0;
}