Cod sursa(job #2306467)
Utilizator | Data | 22 decembrie 2018 13:32:43 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<cstdio>
#define N 5000001
int n,k,i,q[N],a[N],p,u;
long long s;
int main()
{
freopen("deque.in","r",stdin),freopen("deque.out","w",stdout),scanf("%d%d",&n,&k);
for(p=i=1;i<=n;i++)
{
for(scanf("%d",a+i);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);
}