Pagini recente » Cod sursa (job #2721027) | Cod sursa (job #2586120) | Cod sursa (job #1115118) | Cod sursa (job #2746282) | Cod sursa (job #2639894)
#include <bits/stdc++.h>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
list<pair<int,int>> q;
int64_t suma;
int n,k,x;
int main()
{
f>>n>>k;
for(int i=1;i<k;i++)
{
f>>x;
while(q.size() && x <= q.back().first)
q.pop_back();
q.push_back(make_pair(x,i));
}
for(int i=k;i<=n;i++)
{
if(q.front().second==i-k)
q.pop_front();
f>>x;
while(q.size() && x <= q.back().first)
q.pop_back();
q.push_back(make_pair(x,i));
suma += q.front().first;
}
g<<suma;
return 0;
}