Pagini recente » Cod sursa (job #276086) | Cod sursa (job #2609414) | Cod sursa (job #835532) | Cod sursa (job #2747963) | Cod sursa (job #2305825)
#include <iostream>
using namespace std;
const int N=5000001;
int dq[N],v[N];
int main()
{
int n,k,i,st,dr;
long long s=0;
cin>>n>>k;
for(i=0;i<n;i++)
{
cin>>v[i];
}
st=0;dr=-1;
for(i=0;i<n;i++)
{
if(st<=dr && dq[st]==i-k)
{
st++;
}
while(st<=dr && v[i]<=v[dq[dr]])
{
dr--;
}
dq[++dr]=i;
if(i>=k-1)
{
s+=v[dq[st]];
}
//cout<<v[dq[st]]<< " ";
}
cout << s;
return 0;
}