Pagini recente » Cod sursa (job #302515) | Cod sursa (job #1454134) | Cod sursa (job #2845664) | Cod sursa (job #1440560) | Cod sursa (job #1486189)
#include<cstdio>
int n,k,i,j,p,u,v[5001000],d[5001000];
long long s;
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>=p){
u--;
}
d[++u]=i;
if(i>=k){
if(i-d[p]==k)
p++;
s+=v[ d[p] ];
}
}
fprintf(g,"%lld",s);
fclose(f);
fclose(g);
return 0;
}