Pagini recente » Statistici Anghelescu Matei (matei124) | kingovdeception | pregatire_onig | Istoria paginii runda/cmnv_01/probleme | Cod sursa (job #2912892)
#include <fstream>
#include <list>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
list <int> l;
int v[5000005];
int main()
{
int n,k,a;
long long sum=0;
cin>>n>>k;
for(int i=1; i<=n; i++)
{
cin>>a;
v[i]=a;
while(l.empty()==0&&a<=v[l.back()])
l.pop_back();
l.push_back(i);
if(l.front()==i-k)
l.pop_front();
if(i>=k)
sum+=v[l.front()];
}
cout<<sum;
return 0;
}