UVA442 Matrix Chain Multiplication
来源:互联网 发布:数控刀具网络销售 编辑:程序博客网 时间:2024/05/22 06:14
Matrix Chain Multiplication
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 isarbitrary. However, the number of elementary multiplications needed strongly depends on theevaluation 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 fora 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 ofmatrices in the first part. The next n lines each contain one capital letter, specifying the name of thematrix, 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就是判断矩阵相乘要进行多少次乘法。。只有第一个的列,等于第二个的行才能相乘,否则error。进行乘法的次数就是第一个的行 乘以 第一个的列 乘以第二个的列。。思路就是找到‘)’就把前面两个矩阵去取来相乘计算次数,‘(’也要取出来,然后把乘完后的新矩阵在push进去。新矩阵的行列就是第一个的行和第二个的列。。AC代码:#include<iostream>#include<stdio.h>#include<string>#include<stack>using namespace std;struct mat {char flag;int row;int col;};int main () {stack<char> sta;mat mats[100];string str;int t;cin >> t;getchar();for (int i = 0; i < t ;i++) {cin >> mats[i].flag >> mats[i].row >> mats[i].col;}while (cin >> str) {if (str.size() == 1) {cout<<"0"<<endl;continue;}int j = t;char temp1,temp2;int t1,t2;int count = 0;bool find = true;for (int i = 0 ; i < str.size();i++) {if (str[i] != ')') {sta.push(str[i]);continue;}if (str[i] == ')') {temp2 = sta.top();sta.pop();temp1 = sta.top();sta.pop();sta.pop();t1 = temp1 - 65;t2 = temp2 - 65;if(mats[t1].col != mats[t2].row) {cout << "error"<<endl;find = false;break;}else {count +=mats[t1].row * mats[t1].col * mats[t2].col;mats[j].flag = 65 + j;mats[j].row= mats[t1].row;mats[j].col = mats[t2].col;sta.push(mats[j].flag);j++;}}}if (find == true)cout << count<<endl;find = true;}return 0;}
- uva442 Matrix Chain Multiplication
- uva442 Matrix Chain Multiplication
- uva442-Matrix Chain Multiplication
- UVA442 Matrix Chain Multiplication
- uva442 Matrix Chain Multiplication
- UVA442 - Matrix Chain Multiplication
- Matrix Chain Multiplication, UVa442
- UVA442 Matrix Chain Multiplication【DP】
- UVA442 Matrix Chain Multiplication【stack】【栈】
- UVa442 Matrix Chain Multiplication(栈)
- UVa442 Matrix Chain Multiplication(矩阵链乘)
- uva442 Matrix chain multiplication(数据结构)
- UVA442 Matrix Chain Multiplication(栈)
- uva442(Matrix Chain Multiplication)—线性表
- UVa442 Matrix Chain Multiplication(矩阵链乘)
- UVa442 Matrix Chain Multiplication(矩阵链乘)java实现
- Matrix Chain Multiplication UVA442 矩阵连乘 stack
- 【日常学习】【栈】【表达式求值】Uva442 - Matrix Chain Multiplication题解
- javassist 直接修改jar包
- Weblogic集群概念和配置
- Oracle中基本的函数(返回table)
- 什么是Bayer格式图像
- DLL中调用约定和名称修饰(二)
- UVA442 Matrix Chain Multiplication
- AVD - PANIC: Could not open… - not a path issue
- Spring Security3
- 如何做个好员工?
- Ubuntu13.04源更新
- UIView init 和 initwithframe
- 指针函数和函数指针
- 纯js写的分页
- Http请求