j=i+lenth-1

            for k in range(i,j):

                q=m[i,k]+m[k+1,j]+p[i-1]*p[k]*p[j]

                if q<m[i,j]:

                    m[i,j]=q

                    s[i,j]=k

    return m,s

if __name__=='__main__':

    p=np.array([50,10,40,30,5])

    m,s=MatrixChain(p)

    print m

print s

结果输出：

m=[[     0.     inf     inf     inf     inf]

      [    inf      0.  20000.  27000.  10500.]

      [    inf     inf      0.  12000.   8000.]

      [    inf     inf     inf      0.   6000.]

      [    inf     inf     inf     inf      0.]]

s=[[ 0.  0.  0.  0.  0.]

    [ 0.  0.  1.  1.  1.]

    [ 0.  0.  0.  2.  2.]

    [ 0.  0.  0.  0.  3.]

    [ 0.  0.  0.  0.  0.]]

----------------------------------------------------------------------------------------------

本文为作者原创，其中代码都是可以运行通过(Python)，希望有所帮助