给定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次。

-Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is a mere of, i = 1,2, ..., n-1. Your task is to determine the matrix multiplication operation with the order, the computation of the n matrix product A1A2 ... An even when the multiplication of the total number of elements to a minimum. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the product A1A2A3 even when calculated according to (A1A2) A3 multiplication of the number of elements required to achieve at least for 7500.