Pagini recente » Cod sursa (job #990142) | Cod sursa (job #372154) | Cod sursa (job #3138923) | Monitorul de evaluare | Cod sursa (job #2716399)
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int dq[5000001];
int v[5000001];
int main()
{
int st=0,dr=-1,n,k;
long long s=0;
cin>>n>>k;
for(int i=0; i<n; i++)
{
cin>>v[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<<s;
return 0;
}