Pagini recente » Cod sursa (job #919877) | Cod sursa (job #194511) | Cod sursa (job #292710) | Cod sursa (job #2420513) | Cod sursa (job #1836382)
#include <fstream>
#include <deque>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int n,k,a;
typedef pair<int,int> adat;
deque <adat> x;
int main()
{
cin>>n>>k;
int o=0;
for(int i=1;i<=n;i++)
{
cin>>a;
while(a<=x.back().first && !x.empty())
x.pop_back();
x.push_back(adat(a,i));
while(x.front().second < i-k+1) x.pop_front();
if(i>=k) o+=x.front().first;
}
cout<<o<<"\n";
return 0;
}