Matrix Chain Multiplication
来源:互联网 发布:java从入门到精通第6版 编辑:程序博客网 时间:2024/04/29 15:51
Total Submit: 468 Accepted Submit: 308
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.
Input Specification
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"
Output Specification
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.Sample Input
9A 50 10B 10 20C 20 5D 30 35E 35 15F 15 5G 5 10H 10 20I 20 25ABC(AA)(AB)(AC)(A(BC))((AB)C)(((((DE)F)G)H)I)(D(E(F(G(HI)))))((D(EF))((GH)I))
Sample Output
000error10000error350015000405004750015125
My Solution
#include <stdio.h>
struct Matrice
{
int used;
int x;
int y;
};
struct Matrice Matrices[27];
struct Matrice Resolve(char** Line, int* value)
{
char* p = *Line;
int v1, v2;
struct Matrice M1, M2;
if(*p != '('){
*value = 0;
*Line = *Line + 1;
return Matrices[*p-'A'];
}
p++;
M1 = Resolve(&p, &v1);
M2 = Resolve(&p, &v2);
p++;
*Line = p;
if(v1 == -1 || v2 == -1) *value = -1;
else{
if(M1.y == M2.x) *value = M1.x * M1.y * M2.y + v1 + v2;
else *value = -1;
}
M1.y = M2.y;
return M1;
}
int main()
{
int MatriceCount, i, x, y, value;
char ch, Line[256], *p;
for(ch = 'A'; ch <= 'Z'; ch++) Matrices[ch-'A'].used = 0;
scanf("%d/n", &MatriceCount);
for(i = 0; i < MatriceCount; i++){
scanf("%c%d%d/n", &ch, &x, &y);
Matrices[ch-'A'].used = 1;
Matrices[ch-'A'].x = x;
Matrices[ch-'A'].y = y;
}
while(gets(Line)){
p = Line;
Resolve(&p, &value);
if(value == -1) printf("error/n");
else printf("%d/n", value);
}
return 0;
}
Run time: 00:00.00
Run memory: 388K
- Matrix Chain Multiplication
- zoj1094 Matrix Chain Multiplication
- Matrix chain multiplication problem
- Matrix Chain Multiplication
- uva442 Matrix Chain Multiplication
- 442 - Matrix Chain Multiplication***
- poj Matrix Chain Multiplication
- 442 - Matrix Chain Multiplication
- zoj1094-Matrix Chain Multiplication
- UVaOJ442---Matrix Chain Multiplication
- poj2246 - Matrix Chain Multiplication
- 442 - Matrix Chain Multiplication
- uva442 Matrix Chain Multiplication
- 442 - Matrix Chain Multiplication
- 442 - Matrix Chain Multiplication
- ZOJ1094-Matrix Chain Multiplication
- Matrix Chain Multiplication uva
- UVA Matrix Chain Multiplication
- 如何才算掌握Java(J2SE篇)
- 无法catch的exception
- JavaScript实现树状菜单
- C++失去竞争力了吗?《C/C++ User's Journal》停刊有感
- spring 问题 启动异常
- Matrix Chain Multiplication
- LumaQQ在Linux下的安装和卸载
- 教你找歌,以后找歌不求人!
- 一次性钥匙,怎理解??
- 孽债与情劫
- 读书写笔记-王爽《汇编语言》
- Linux环境下基于策略的路由
- XML是什么,它可以做什么?——写给XML入门者
- SQLite 一个轻量级别数据库