Pagini recente » Cod sursa (job #1564927) | Cod sursa (job #1239513) | Cod sursa (job #875430) | Cod sursa (job #753941) | Cod sursa (job #2264709)
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
vector <int> q;
int a[5000005];
int n,k;
long long sum;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
cin>>n>>k;
for(int i=0;i<k;++i)
{
cin>>a[i];
while(q.size() && a[q.back()]>=a[i])
q.pop_back();
q.push_back(i);
}
sum+=a[q.front()];
for(int i=k;i<n;++i)
{
cin>>a[i];
while(q.size() && a[q.back()]>=a[i])
q.pop_back();
q.push_back(i);
while(q.back()-q.front() >= k)
q.erase(q.begin());
sum+=a[q.front()];
}
cout<<sum;
return 0;
}