Pagini recente » Cod sursa (job #306650) | Cod sursa (job #2385791) | Cod sursa (job #1456500) | Cod sursa (job #112326) | Cod sursa (job #2457024)
#include <fstream>
#include <deque>
#define ll long long
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
deque< pair<int,int> > q;
int a,n,k;
ll 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.back().first&&q.size()) q.pop_back();
q.push_back(make_pair(a,i));
}
suma+=q.front().first;
for(int i=k+1; i<=n; ++i)
{
cin>>a;
while(q.front().second<=i-k&&q.size()) q.pop_front();
while(a<=q.back().first&&q.size()) q.pop_back();
q.push_back(make_pair(a,i));
suma+=q.front().first;
}
cout<<suma<<"\n";
return 0;
}