Pagini recente » Cod sursa (job #72976) | Cod sursa (job #831385) | Cod sursa (job #281168) | Cod sursa (job #1324314) | Cod sursa (job #2106324)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define pb push_back
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005
#define x1 xdddddddddddddddddd
#define y1 ydddddddddddddddddd
ll n,k,a[5000005],s;
deque <ll> q;
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
ifstream cin("deque.in");
ofstream cout("deque.out");
cin >> n >> k;
for(int i=1;i<=n;i++){
cin >> a[i];
while(q.sz && a[i]<=q[q.sz-1]) q.pop_back();
q.push_back(a[i]);
if(i>=k){
s+=q[0];
if(a[i-k+1]==q[0]) q.pop_front();
}
}
cout << s;
}