动态规划法解矩阵连乘积的最优计算次序问题。按照分解最优解的结构，建立递归关系，计算最优值，构造最优解4个步骤-Dynamic programming solution matrix product even calculate the optimal order problem. Optimal solution in accordance with the decomposition of the structure, the establishment of recursion relati