m[i][j]=0; s[i][j]=0; } printf("矩阵的下标为:\n"); for(i=0;i<7;i++) scanf("%d",&p[i]); matrixChain(p,m,s); printf("The best sequence:\n"); for(i=1;i<=6;i++) { for(j=1;j<=6;j++) printf("%8d",m[i][j]); printf("\n"); } printf("\n"); for(i=1;i<=6;i++) { for(j=1;j<=6;j++) printf("%8d",s[i][j]); printf("\n"); { } { } void matrixChain(int p[7], int m[7][7], int s[7][7]) int n=6,i,j,r,k,t; for ( i = 1; i <= n; i++) m[i][i] = 0; for ( r = 2; r <= n; r++) for ( i = 1; i <= n - r+1; i++) { j=i+r-1; m[i][j] = m[i+1][j]+ p[i-1]*p[i]*p[j]; s[i][j] = i; for ( k = i+1; k < j; k++) { t = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]; if (t < m[i][j]) m[i][j] = t; s[i][j] = k;} 

} } } 4. 运行结果 5. 心得体会 代码实现时要注意的问题：计算问题！！ 因为你要保证在计算 m[i][j]查找 m[i][k]和 m[k+1][j]的时候，m[i][k]和 m[k+1][j] 已经计算出来了。