Description: Description Given a matrix N a matrix chain A1A2A3 ... An, moments Ai dimension of pi-1* pi. We all know that the use of simple matrix multiplication to multiply two dimensions, respectively x, y, and y, z matrix, the required number of multiplication x* y* z. Matrix-chain multiplication problem is how to add the product to the matrix in parentheses, allowing them to reach a minimum number of multiplication. Input input first acts of a positive integer N (1 < = N < = 200). Indicated that the number of matrices. Enter the second line contains N+1 integers, respectively, indicated that pi (0 < = i < = N), where each pi in [1,200] range. Output output, said at least one integer number multiplication to be carried out.
To Search:
File list (Check if you may need any files):
JUZHEN.plg
Debug\JUZHEN.obj
.....\JUZHEN.pch
.....\vc60.idb
.....\vc60.pdb
JUZHEN.cpp
JUZHEN.dsp
JUZHEN.dsw
JUZHEN.ncb
JUZHEN.opt
Debug
Download