Cod sursa(job #672896)
Utilizator | Data | 3 februarie 2012 13:16:04 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int v[5000001],q[5000001];
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
long long s=0;
int n,k,i,p,u;
scanf("%d%d",&n,&k);
p=1;
u=0;
for(i=1;i<=n;i++){
scanf("%d",&v[i]);
while(p<=u&&v[q[u]]>=v[i]){
--u;
}
q[++u]=i;
if(i-q[p]==k){
p++;
}
if(i>=k)
s+=v[q[p]];
}
printf("%lld\n",s);
return 0;
}