总体思想就是列出所有可能。procedure work;begin for i:=1 to n do f[i,i]:=0;for p:=1 to n-1 do for i:=1 to n-p do begin j:=i+p;f[i,j]:=maxlongint;for k:=i to j-1 do if f[i,j]>f[i,k]+f[k+1,j]then f[i,j]:=f[i,k]+f[k+1,j];f[i,j...