python动态规划算法最大k乘积_划分类动态规划——乘积最大（洛谷1018，codevs1017)...

本题由于比较老，数据实际也比较小，用long long 即可通过

代码：

var n,m,i,j,k,sum:longint; s,t:string;

a:array[1..40,1..40] of longint;

f:array[1..40,0..6] of int64;

function max(x,y:longint):longint;

begin

if x>y then exit(x) else exit(y);

end;

begin

readln(n,m);

readln(s);

for i:=1 to n do       //取出i到j之间的数值

for j:=1 to n do

for k:=i to j do

a[i,j]:=a[i,j]*10+ord(s[k])-48;

for i:=1 to n do f[i,0]:=a[1,i];//初始化被0个划分的数值

for j:=1 to m do        //阶段，j个乘号，从1个到m个

for i:=j+1 to n do    //状态，前i个数，数要比乘号多一个，j+1到n

begin

for k:=j to i do  //决策，枚举从j开始到i的最大值

begin

f[i,j]:=max(f[k,j-1]*a[k+1,i],f[i,j]);;

end;

end;

writeln(f[n,m]);

end.