版本5和6间的区别
于2007-01-18 00:24:43修订的的版本5
大小: 3747
编辑: 167
备注:
于2008-02-23 15:36:58修订的的版本6
大小: 3747
编辑: localhost
备注: converted to 1.6 markup
未发现区别!

Matrix Chain Multiplication

Time limit: 1 Seconds

Memory limit: 32768K

Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.

For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.

1. Input

Input consists of two parts: a list of matrices and a list of expressions.

The first line of the input file contains one integer n (1 <= n <= 26), representing the number of matrices in the first part. The next n lines each contain one capital letter, specifying the name of the matrix, and two integers, specifying the number of rows and columns of the matrix.

The second part of the input file strictly adheres to the following syntax (given in EBNF):

  • SecondPart= Line { Line } <EOF>

  • Line = Expression <CR>

  • Expression = Matrix | "(" Expression Expression ")"
  • Matrix = "A" | "B" | "C" | ... | "X" | "Y" | "Z"

2. Output

For each expression found in the second part of the input file, print one line containing the word "error" if evaluation of the expression leads to an error due to non-matching matrices. Otherwise print one line containing the number of elementary multiplications needed to evaluate the expression in the way specified by the parentheses.

3. Sample Input

zju1094 (2008-02-23 15:36:58由localhost编辑)

ch3n2k.com | Copyright (c) 2004-2020 czk.