Pagini recente » Cod sursa (job #3185410) | Cod sursa (job #2622610) | Cod sursa (job #2385701) | Cod sursa (job #455605) | Cod sursa (job #2437171)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
#define nmax 5000005
deque <long long> Deck;
long long n,k,v[nmax],sum=0;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
while(Deck.size()>0 && v[i]<=v[Deck.back()])
Deck.pop_back();
Deck.push_back(i);
if(Deck.front()==i-k)
Deck.pop_front();
if(i>=k)
sum+=v[Deck.front()];
}
fout<<sum;
}