做模拟赛受虐,切usaco玩。
1: program bzoj1617;
2: uses math;
3: const maxn=2500;
4: var f,cost:array[0..maxn] of longint;5: n,i,j:longint;6: begin
7: filldword(f,sizeof(f)>>2,maxlongint);8: readln(n,cost[0]);9: for i:=1 to n do10: begin
11: readln(cost[i]);12: inc(cost[i],cost[i-1]);13: end;
14: f[0]:=0;15: for i:=1 to n do16: for j:=1 to i do17: F[i]:=min(F[i-j]+cost[j]+cost[0],F[i]);18: writeln(F[n]-cost[0]);19: end.