Cod sursa(job #385181)
| Utilizator | Data | 22 ianuarie 2010 10:51:21 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
//
#include<stdio.h>
FILE *f=fopen("deque.in","r"), *g=fopen("deque.out","w");
long long v[500001],s,n,k,best,i,j,start,finish,c[500001];
int main()
{
int i;
fscanf(f,"%lld %lld", &n, &k);
for(i=1;i<=n;i++)
fscanf(f,"%lld", &v[i]);
start=1;
finish=0;
for(i=1;i<=n;i++)
{
while(start <= finish && v[i] <= v[c[finish]])
finish--;
c[++finish]=i;
if(c[start]==i-k)
start++;
if(i>=k)
s=s+v[c[start]];
}
fprintf(g,"%lld",s);
fclose(f);
fclose(g);
return 0;
}
