Cod sursa(job #307219)
Utilizator | Lazari Mihai mlazari | Data | 23 aprilie 2009 18:09:34 |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#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;
}