Pagini recente » Cod sursa (job #2542619) | Cod sursa (job #474180) | Cod sursa (job #969007) | Cod sursa (job #2688250) | Cod sursa (job #2703157)
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double
vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}
int a[5000005], Deque[5000005];
int back, front;
int32_t main(){
startt;
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
front = 1;
back = 0;
int n, k;
cin >> n >> k;
int ans = 0;
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < n; i++)
{
while (front <= back && a[i] <= a[Deque[back]]) back--;
Deque[++back] = i;
if (Deque[front] == i-k) front++;
if (i >= k-1) ans += a[Deque[front]];
}
cout << ans << endl;
}