Cod sursa(job #250540)
| Utilizator | Data | 31 ianuarie 2009 10:13:28 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
#define DIM 5000001
int A[DIM];
int D[DIM];
int n,k,i,p,u;
long long s;
int main(){
FILE *f = fopen("deque.in","r");
fscanf(f,"%d %d",&n,&k);
fscanf(f,"%d",&A[1]);
p=u=1;
D[u]=1;
for (i=2;i<=n;i++){
fscanf(f,"%d",&A[i]);
while (p<=u && A[i]<=A[D[u]])
u--;
D[++u] = i;
if (D[p]<i-k+1)
p++;
if (i>=k) {
s+=A[D[p]];
}
}
fclose(f);
FILE *g = fopen("deque.out","w");
fprintf(g,"%lld\n",s);
fclose(g);
return 0;
}