说明：  C语言实现动态规划 矩阵连乘问题！ 问题：给定n个矩阵{A1,A2,…，An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。计算这n个矩阵的连乘积。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以由许多不同的计算次序。计算次序不同计算连乘积的计算量也不同。运用动态规划法思想给出你认为合理的计算矩阵连乘积最少次数的方案。
(C language dynamic programming matrix continually multiply problems! The problem: given n matrix {A1, A2, ..., An}, where Ai and Ai+1 is multiplicative, i = 1,2, ..., n-1. Calculating these n matrix product. Law, the calculation of the matrix with the product of order by many different computing Since matrix multiplication meet combined. Calculating order of different computing connected multiplied by the amount of calculation is also different. Given that you think that the reasonable calculation matrix with the product of at least the number of programs using dynamic programming thought.)