Pagini recente » Cod sursa (job #2379109) | Cod sursa (job #60869) | Cod sursa (job #3266334) | Cod sursa (job #2586719) | Cod sursa (job #407502)
Cod sursa(job #407502)
#include<stdio.h>
#define Nmax 5000005
int deq[Nmax],st,dr,N,K,A[Nmax];
long long Sum;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&N,&K);
st=1 , dr=0;
for(int i=1;i<=N;++i)
{
scanf("%d ",&A[i]);
while(st<=dr && A[deq[dr]] > A[i]) --dr;
deq[++dr]=i;
if (deq[st] == i-K)
++st;
if (i>=K)
Sum += A[deq[st]];
}
printf("%lld\n",Sum);
return 0;
}