Pagini recente » Cod sursa (job #1315184) | Cod sursa (job #993500) | Cod sursa (job #1744051) | Cod sursa (job #3225569) | Cod sursa (job #271829)
Cod sursa(job #271829)
#include<iostream.h>
#include<stdio.h>
int A[5000001],deque[5000001];
unsigned int n,k,i,front=1,back;
unsigned long long int s;
int main()
{
freopen("deque.in","r",stdin);freopen("deque.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&A[i]);
for(i=1;i<=n;i++)
{
while(front<=back && A[i]<=A[deque[front]])
back--;
deque[back++]=i;
if(deque[front]==i-k)
front++;
if(i<=k)
s+=A[deque[front]];
}
printf("%llu",s);
return 0;
}