Pagini recente » Cod sursa (job #2495166) | Cod sursa (job #1303364) | Cod sursa (job #1294851) | Cod sursa (job #136947) | Cod sursa (job #2562918)
#include <bits/stdc++.h>
using namespace std;
/**********************************************/
deque <pair <int,int> >dq;
int n,k;
int sum;
/**********************************************/
ifstream f("deque.in");
ofstream g("deque.out");
/**********************************************/
///--------------------------------------------------------
inline void readInput()
{
f>>n>>k;
}
///--------------------------------------------------------
///--------------------------------------------------------
inline void Solution()
{
for(int i=1;i<=n;i++)
{
int nr;
f>>nr;
if(i>1)
{
if(dq.front().second<=i-k) dq.pop_front();
}
dq.push_back({nr,i});
while(dq.front().first>dq.back().first && !dq.empty()) dq.pop_front();
if(i>=k) sum+=dq.front().first;
}
}
///--------------------------------------------------------
inline void Afisare()
{
g<<sum;
}
///--------------------------------------------------------
int main()
{
readInput();
Solution();
Afisare();
return 0;
}