矩阵连乘 mN,N],sN,N]赋1; MatriXChain(,j) 递归备忘录方法 if i=i then m[i,j=0; return m[]=00 for k=i to j-1 do a=m[i,k];b=m收k+1,j if a==-1 then a=MatriX Chain(i, k) if b==-1 then b= MatriXChain(k+1, j) g=a+b+rrkr if q<m[i, j] then m[i】]=q; s[]=k; 13矩阵连乘 13 m[N,N], s[N,N] 赋-1; MatrixChain (i, j) if i=j then m[i, j]=0; return; m[i, j] = ∞; for k=i to j-1 do a = m[i, k]; b = m[k+1, j]; if a == -1 then a = MatrixChain(i, k); if b == -1 then b = MatrixChain(k+1, j); q = a + b + ri-1 rk rj if q<m[i, j] then m[i,j]=q; s[i,j]=k; 递归备忘录方法