问 题：矩阵连乘问题

描 述：给定n个矩阵｛A1,A2,...,An｝，其中Ai与Ai+1是可乘的，i=1，2…，n-1.考察这n个矩阵的连乘积A1A2...An。矩阵A 和B可乘的条件是矩阵A的列数等于矩阵B的行数。若A是一个p x q矩阵，B是一个q * r矩阵，则其乘积C=AB是一个p * r矩阵,需要pqr次数乘。

编程任务：对于给定的相继n个矩阵{A1,A2, ..., An }及其维数，编程计算矩阵连乘积A1A2...An 需要的最少数乘次数。

-Question: Even by the issue of Matrix Descr iption: given n matrices (A1, A2 ,..., An), which Ai and Ai+ 1 is the multiplicative, i = 1,2 ..., n-1. Visit this n Even a matrix product A1A2 ... An. Matrix A and B take the condition that the matrix A the number of rows equal to the number of rows of matrix B. If A is a pxq matrix, B is a q* r matrix, then their product C = AB is a p* r matrix, the need to take the number of pqr. Programming tasks: one after another for a given n matrices (A1, A2, ..., An) and its dimension, programming computing matrix product A1A2 ... An even needed by the number of at least a few.