Pagini recente » Cod sursa (job #1267994) | Cod sursa (job #237854) | Cod sursa (job #683416) | Cod sursa (job #692099) | Cod sursa (job #257638)
Cod sursa(job #257638)
#include<stdio.h>
long long V[5000001],D[5000001],n,F,B,k;
long long suma;
int main(){
freopen("deque.in","rt",stdin);
freopen("deque.out","wt",stdout);
scanf("%lld%lld",&n,&k);long long i;
for(i=1;i<=n;i++) scanf("%lld",V+i);
F=1;B=0;
for(i=1;i<=n;i++){
for(;F<=B && V[i]<=V[D[B]];) B--;
D[++B]=i;
if(D[F]==i-k) F++;
if(i>=k)suma+=V[D[F]];
}printf("%lld",suma);
return 0;
}