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<m[i][j]:
m[i][j]=q
s[i][j]=k
return m,s
def Print_Optimal_Oarens(s,i,j):
if i==j:
print("A",i,end=" ")
else:
# print("(", end="")
print("(",end="")
Print_Optimal_Oarens(s, i, s[i][j])
Print_Optimal_Oarens(s, s[i][j]+1, j)
print(")",end="")
p = [30, 35, 15, 5, 10, 20, 25]
m,s=Maxtrix_Chain_order(p)
Print_Optimal_Oarens(s,1,6)
算法导论数组从一开始, Python for 循环右边界 不需要减1 ,看了网上的一些代码 都把 len -1 了造成了很多不必要的改动