4月29日

某入学考试解题报告

T4

var n,k,i,j,x:longint;
f:array[0..1000,0..1000]of longint;
a:array[0..1000]og longint;
begin
a[0]:=0;
readln(n,k);
for i:=1 to n do
begin
read(j);a[i]:=a[i-1]+j;
end;
for i:=1 to n do
f[1,i]:=a[i];
for i:=2 to k do
for j:=i to n do
begin f[i,j]:=0;
for x:=j-1 downto i-1 do
if f[i,j]<(f[i-1,x]+a[j]-a[x]) then f[i,j]:=(f[i-1,x]+a[j]-a[x]);
end;
write(f[k,n]);
end.