Cod sursa(job #1486188)
Utilizator | Data | 14 septembrie 2015 01:57:37 | |
---|---|---|---|
Problema | Deque | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<cstdio>
int n,k,i,j,p,u,s,v[5001000],d[5001000];
FILE *f,*g;
int main(){
f=fopen("deque.in","r");
g=fopen("deque.out","w");
fscanf(f,"%d%d",&n,&k);
for(i=1;i<=n;i++){
fscanf(f,"%d",&v[i]);
}
p=1;
u=0;
for(i=1;i<=n;i++){
while(v[i]<v[ d[u] ]&&u>0){
u--;
}
d[++u]=i;
if(i>=k){
if(i-d[p]==k)
p++;
s+=v[ d[p] ];
}
}
fprintf(g,"%d",s);
fclose(f);
fclose(g);
return 0;
}