Cod sursa(job #549149)
| Utilizator | Data | 8 martie 2011 10:27:08 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
int i,n,k,v[5000001],d[5000001],in=1,sf=0;
long long sol;
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",&v[i]);
for(i=1;i<=n;i++)
{
while(in<=sf&&v[i]<=v[d[sf]])
sf--;
d[++sf]=i;
if(d[in]==i-k)
in++;
if(i>=k)sol+=v[d[in]];
}
printf("%lld",sol);
return 0;
}
