Cod sursa(job #2712304)
| Utilizator | Data | 25 februarie 2021 16:47:41 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<bits/stdc++.h>
#define ll long long
#define nxm 5000005
using namespace std;
int n, m, a[nxm], deq[nxm];
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> 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]];
}
}
cout << sum;
return 0;
}
