Cod sursa(job #2302716)
Utilizator | Data | 15 decembrie 2018 08:13:34 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
int n,k,i,q[5000001],a[5000001],p=1,u;
long long s;
int main()
{
freopen("deque.in","r",stdin),freopen("deque.out","w",stdout),scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",a+i);
for(i=1;i<=n;i++)
{
for(;p<=u&&a[i]<=a[q[u]];u--);
q[++u]=i;
if(q[p]==i-k)
p++;
if(i>=k)
s+=a[q[p]];
}
printf("%lld",s);
}