矩阵链乘法 算法导论原版

def Maxtrix_Chain_order(p):
    '''
    :param p:P list is cost of Matrix
    :return: return the list of m and s m is cost of matrix
    S is a copy of matrix ' cost
    '''
    n=len(p) # len n 不用减一 因为Python for循环 右边界
    m=[[0 for i in range(n)] for j in range(n) ]
    s=[[0 for i in range(n)] for j in range(n) ]
    for l in range(2,n):
        for i in range(1,n-l+1):
            j=i+l-1
            m[i][j]=123123123123
            for k in range(i,j):
                q=m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j]
                if q