Pagini recente » Cod sursa (job #2742945) | Cod sursa (job #1314936) | Cod sursa (job #386424) | Cod sursa (job #2456253) | Cod sursa (job #2456997)
#include <fstream>
#include <deque>
#include <limits.h>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
deque< pair<int,int> > q;
int a,n,k,suma;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin>>n>>k;
cin>>a;
q.push_back(make_pair(a,1));
for(int i=2;i<=k;++i)
{
cin>>a;
while(a<=q.front().first)
{
q.pop_front();
}
q.push_back(make_pair(a,i));
}
suma+=q.front().first;
for(int i=k+1;i<=n;++i)
{
cin>>a;
while((a<=q.front().first||q.front().second<=i-k)&&q.size()) q.pop_front();
q.push_back(make_pair(a,i));
suma+=q.front().first;
}
cout<<suma<<"\n";
return 0;
}