Cod sursa(job #239692)
Utilizator | Data | 5 ianuarie 2009 15:04:47 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<stdio.h>
#define N 5000010
int n,k,a[N],d[N];
long long rez;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
int p=1,u=0;
scanf("%d%d",&n,&k);
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
if(p<=u && i-d[p]>=k)
p++;
while(p<=u && a[i]<=a[d[u]])
u--;
d[++u]=i;
if(i>=k)
rez+=(long long)a[d[p]];
}
printf("%lld\n",rez);
return 0;
}