问题描述
源代码
n = int(input()) # 输入几个矩阵
p = list(input().split())
for i in range(0, len(p)):
p[i] = int(p[i])
m = [0*n]*n
s = [0*n]*n
for k in range(2, n+1):
for i in range(0, n-k+1):
j = i-k+1
m[i][j] = m[i+1][j]+p[i+1]*p[i]*p[j+1]
s[i][j]=i
for r in range(i+1, j):
t = m[i][r]+m[r+1][j]+p[i]*p[r+1]*p[j+1]
if(t<m[i][j]):
s[i][j]=r
m[i][j]=t