Metrix_Chain

import numpy as np

q=[30,35,15,5,10,20,25]
n= len(q)-1
m=np.zeros((n+1,n+1))
s=np.zeros((n+1,n+1))

for t in range(2,n+1): #合并集的个数
    for i in range(1,n-t+2):  #每一行的最优值，每行有n-t+1个
        j=i+t-1         #末尾索引，因为i是从1开始的所以要减1
        m[i][j]=10000000
        for k in range(i,j):        #k相当于最优值的切割
            temp = m[i][k]+m[k+1][j] + q[i-1]*q[k]*q[j]
            if(temp<m[i][j]):
                m[i][j]=temp
                s[i][j]=k
print(m)
print(s)