Pagini recente » Cod sursa (job #979498) | Cod sursa (job #1067033) | Cod sursa (job #2516630) | Cod sursa (job #725367) | Cod sursa (job #3286620)
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,s,v[5000200];
deque <int> dq;
int32_t main()
{
f>>n>>k;
for(int i=1; i<=n; i++)
{
f>>v[i];
while(!dq.empty() and v[dq.back()]>=v[i])
dq.pop_back();
while(!dq.empty() and dq.front()<=i-k)
dq.pop_front();
dq.push_back(i);
if(i>=k)
s+=v[dq.front()];
}
g<<s;
return 0;
}