Pagini recente » Cod sursa (job #1845737) | Cod sursa (job #669207) | Cod sursa (job #2595633) | Cod sursa (job #3176093) | Cod sursa (job #2568324)
#include <bits/stdc++.h>
using namespace std;
int n, k, s, i, x;
struct orice
{
int poz;
int val;
};
deque <orice> D;
int main()
{
ifstream fin("deque.in");
ofstream fout("deque.out");
fin >> n >> k;
for(i=1; i<=n; i++)
{
fin >> x;
while(!D.empty() && x<=D.back().val)D.pop_back();
D.push_back({i,x});
if(D.front().poz==i-k)D.pop_front();
if(i>=k)
s=s+D.front().val;
}
fout << s;
return 0;
}