说明：  问题描述 给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-1。 你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。 例如：3个矩阵A1，A2，A3，阶分别为10×100、100×5、5×50，计算连乘积A1A2A3时按（A1A2）A3所需的元素乘法次数达到最少，为7500次。
(Description of the problem given n matrices A1, A2, ..., An, which, Ai and Aj+ 1 is the multiplicative, i = 1,2, ..., n-1. Your mission is to identify the matrix even by computing the order, so that calculation of this n-matrix product A1A2 ... An even when the total number of elements to achieve a minimum of multiplication. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the calculation even when the product A1A2A3 by (A1A2) A3 multiply the number of elements required to achieve at least for the 7500 meeting.)