Cod sursa(job #385164)
Utilizator | Data | 22 ianuarie 2010 10:34:27 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
//
#include<stdio.h>
FILE *f=fopen("deque.in","r"), *g=fopen("deque.out","w");
long v[5000001],s,n,k,best,i,j;
int main()
{
int i;
fscanf(f,"%d %d", &n, &k);
for(i=1;i<=n;i++)
fscanf(f,"%d", &v[i]);
for (i =1;i<=n-k+1; i++)
{
best=100000000;
for (j=0;j<k;j++)
if (v[i+j] < best) best = v[i+j];
s += best;
}
fprintf(g,"%d",s);
fclose(f);
fclose(g);
return 0;
}