Pagini recente » Cod sursa (job #272789) | Cod sursa (job #722499) | Cod sursa (job #2727502) | Cod sursa (job #1099874) | Cod sursa (job #1624928)
#include <iostream>
#include <fstream>
using namespace std;
int d[5000001], v[5000001];
int main()
{
ifstream cin("deque.in");
ofstream cout("deque.out");
int n, k, u=1, i, p=1;
long s=0;
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
d[p]=1;
for(i=2;i<=n;i++)
{
while(u>=p && v[i]<=v[d[u]])
u--;
d[++u] = i;
if(d[p]==i-k)
p++;
if(i>=k)
s+=v[d[p]];
}
cout<<s;
return 0;
}