Cod sursa(job #257637)
Utilizator | Badu Badu Badu | Data | 13 februarie 2009 18:28:34 |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#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("%d%d",&n,&k);long long i;
for(i=1;i<=n;i++) scanf("%d",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("%ld",suma);
return 0;
}