Pagini recente » Cod sursa (job #3294357) | Cod sursa (job #2889318) | Cod sursa (job #2533055) | Cod sursa (job #1435290) | Cod sursa (job #3247389)
#include <bits/stdc++.h>
using namespace std;
int v[1000005];
deque<int> dq;
int main()
{
ifstream cin("deque.in");
ofstream cout("deque.out");
int n, k, sum=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>v[i];
while(dq.empty() == false && v[dq.back()] >= v[i])
dq.pop_back();
dq.push_back(i);
if(dq.front() <= i - k)
dq.pop_front();
if(i >= k)
sum += v[dq.front()];
}
cout<<sum;
return 0;
}