动态规划实现矩阵链相乘 使用动态规划，实现矩阵链的相乘，减少了代价-Dynamic programming to achieve matrix-chain multiplication

矩阵链乘。给定多个矩阵的维度，求出他们的相乘顺序，使得，按这样的顺序相乘的代价最小-Matrix chain multiplication。Solve the matrix chain order for a specic problem. This can be done by computing MATRIXCHAIN- ORDER(p) where p = h5 10 3 12 5 50 6i