Pagini recente » Cod sursa (job #3273105) | Cod sursa (job #2306886) | Cod sursa (job #1980647) | Cod sursa (job #519381) | Cod sursa (job #1703078)
#include <bits/stdc++.h>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
#define Nmax 5000010
deque <int> q;
int n,k,minn,s,v[Nmax];
int main()
{
in>>n>>k;
for(int i=1;i<=n;i++){
in>>v[i];
}
for(int i=1;i<=n;i++){
while(!q.empty() && v[i] <= v[q.back()])q.pop_back();
q.push_back(i);
if(q.front() == i-k)q.pop_front();
if(i >= k) s+=v[q.front()];
}
out<<s;
return 0;
}