Uva 442 Matrix Chain Multiplication
来源:互联网 发布:天津教育网络教研平台 编辑:程序博客网 时间:2024/05/22 12:36
Description
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 ( ), 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
用栈解决问题;
由于严格地遵守格式;
只要遇到矩阵压入栈,遇到)就弹出两个矩阵,运算后,再压入栈;
矩阵可以相乘的条件是前一个矩阵的列数等于后一个矩阵的行数;
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<stack>using namespace std;struct Matrix{ int x; int y;}matrix[26];stack<Matrix> s;int main(){ int n; scanf("%d",&n); char c; for(int i=0;i<n;++i) { scanf(" %c",&c); scanf("%d %d",&matrix[c-'A'].x,&matrix[c-'A'].y); } string str; while(cin>>str) { bool flag=0; int ans=0; for(int i=0;i<str.length();++i) { if(str[i]<='Z'&&str[i]>='A') { s.push(matrix[str[i]-'A']); } else if(str[i]==')') { Matrix t1,t2; t2.x=s.top().x; t2.y=s.top().y; s.pop(); t1.x=s.top().x; t1.y=s.top().y; s.pop(); //cout<<t1.x<<" "<<t1.y<<endl; //cout<<t2.x<<" "<<t2.y<<endl; if(t1.y!=t2.x) { flag=1; break; } else { ans+=t1.x*t1.y*t2.y; Matrix temp; temp.x=t1.x; temp.y=t2.y; s.push(temp); } } } if(flag) printf("error\n"); else printf("%d\n",ans); } return 0;}
- UVa 442 Matrix Chain Multiplication
- Uva 442 Matrix Chain Multiplication
- UVa 442 Matrix Chain Multiplication
- uva 442 - Matrix Chain Multiplication
- UVa 442 - Matrix Chain Multiplication
- UVa 442 - Matrix Chain Multiplication
- UVa 442 Matrix Chain Multiplication
- UVA 442 Matrix Chain Multiplication
- uva 442 - Matrix Chain Multiplication
- uva 442 Matrix Chain Multiplication
- UVa 442 - Matrix Chain Multiplication
- UVa 442 - Matrix Chain Multiplication
- uva 442Matrix Chain Multiplication
- uva-442 Matrix Chain Multiplication
- UVa 442 - Matrix Chain Multiplication
- uva 442 - Matrix Chain Multiplication
- UVA 442 Matrix Chain Multiplication
- uva 442 Matrix Chain Multiplication
- POJ题目分类
- 包图
- java编程中常见的异常
- C++中 vector、list、deque、set、map的底层实现
- 防卫导弹(最长下降子序列)
- Uva 442 Matrix Chain Multiplication
- 面试某公司前端关于javascript中this的总结
- 堆排序
- PAT1045 Favorite Color Stripe
- SAS中library是 excel引擎,LIBNAME STATEMENT
- Oracle卸载步骤
- SQL注入式攻击
- poj 【1321】
- java学习---JVM中的垃圾收集算法和Heap分区简记