Pagini recente » Cod sursa (job #2975931) | Cod sursa (job #1566199) | Cod sursa (job #1954148) | Cod sursa (job #1051454) | Cod sursa (job #307219)
Cod sursa(job #307219)
#include<stdio.h>
#include<stdlib.h>
#define MAXN 5000000
int a[MAXN],d[MAXN],n,k,i,p=1,u=0;
long long s=0;
int main() {
freopen("deque.in","r",stdin);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++) scanf("%d",a+i);
fclose(stdin);
for(i=1;i<=n;i++) {
while((u>=p)&&(a[d[u]]>=a[i])) u--;
d[++u]=i;
if(i>=k) {
if(d[p]==i-k) p++;
s+=a[d[p]];
}
}
freopen("deque.out","w",stdout);
printf("%lld",s);
fclose(stdout);
return 0;
}