Pagini recente » Cod sursa (job #2097102) | Cod sursa (job #1455302) | Cod sursa (job #997036) | Cod sursa (job #2578124) | Cod sursa (job #2712305)
#include<bits/stdc++.h>
#define ll long long
#define nxm 5000005
using namespace std;
int n, m, a[nxm], deq[nxm];
ifstream fin("deque.in");
ofstream fout("deque.out");
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n, m;
fin >> n >> m;
for (int i = 1; i <= n; ++i) {
fin >> a[i];
}
int front = 1, back = 0;
ll sum = 0;
for (int i = 1; i <= n; ++i) {
while(front <= back && a[i] <= a[deq[back]]) {
back--;
}
back++;
deq[back] = i;
if (deq[front] == i - m) {
front++;
}
if (i >= m) {
sum += a[deq[front]];
}
}
fout << sum;
return 0;
}