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