Pagini recente » Cod sursa (job #960491) | Cod sursa (job #691525) | Cod sursa (job #3272901) | Cod sursa (job #2779221) | Cod sursa (job #2889104)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int main()
{
int n, k;
int v[50010], w[50010];
long long suma = 0;
cin>>n>>k;
for (int i = 1; i <= n; i++) cin>>v[i];
int beginn = 1, finall = 0;
for (int i = 1; i <= n; i++){
while (beginn <= finall and v[i] <= v[w[finall]]) finall--;
w[++finall] = i;
if (k <= i){
suma += v[w[beginn]];
if (w[beginn] == i - k + 1) beginn++;
}
}
cout<<suma;
return 0;
}