Pagini recente » Cod sursa (job #3218413) | Cod sursa (job #30497) | Cod sursa (job #676608) | Cod sursa (job #1672088) | Cod sursa (job #2636434)
//#include <iostream>
#include <fstream>
using namespace std;
int n,a[5000002],dq[5000002],i,k,st,dr;
long long s;
ifstream cin("deque.in");
ofstream cout("deque.out");
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>a[i];
dr=1; st=0;
for(i=1;i<=n;i++)
{
while(dr<=st &&a[i]<=a[dq[st]])
{
st--;
}
dq[++st]=i;
if(dq[dr]==i-k)
dr++;
if(i>=k)
s=s+a[dq[dr]];
}
cout<<s;
return 0;
}