矩阵连乘 Matrix-Chain-Order(r) n=length(o) 自底向上方法 for j=1 to n do m[, 1=0 for x1 to n- do for i=1 to n-x do 」=|+x m for k=i to j-1 do q=m[i,k]+m[k+1,j+1 if q<m[i, j] then m[小]=q; [】]=k; return m and s 12矩阵连乘 12 Matrix-Chain-Order(r) n=length(r)； for i=1 to n do m[i, i]=0; for x=1 to n-1 do for i=1 to n-x do j = i+x; m[i, j] = ∞; for k=i to j-1 do q = m[i, k]+m[k+1, j]+ri-1 rk rj if q<m[i, j] then m[i,j]=q; s[i,j]=k; return m and s 自底向上方法