矩阵链乘法最有次序问题: P = [30, 35, 15, 5, 10, 20] M = [[0]*6 for i in range(6)] S = [[0]*6 for i in range(6)] n = 6 for r in range(2, n): for i in range(1, n-r+1): j = r + i - 1 M[i][j] = M[i][i] + M[i+1][j] + P[i-1]*P[i]*P[j] _________ for k in range(i+1, j): t = _____________ if t < M[i][j]: _________ S[i][j] = k for i in range(len(M)): print M[i] for j in range(len(S)): print S[j]