Uva 442 Matrix Chain Multiplication (矩阵连乘)
来源:互联网 发布:ncut算法的详细解释 编辑:程序博客网 时间:2024/06/13 12:07
[Submit] [Go Back] [Status]
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
题目大意:给出字符代表矩阵的定义,计算表达示中矩阵相乘的总次数
题目解析:如果遇到字母则进栈,如果遇到 ')' 则弹出栈顶两个字符。进行运算:
sum += mat[top2].row * mat[top1].row * mat[top1].col;再把新的矩阵压入栈中:新矩阵的行和列为
mat[fuck].row = mat[top2].row;mat[fuck].col = mat[top1].col;
#include <stdio.h>#include <stack>#include <string.h>#include <ctype.h>using namespace std;const int N = 1000;char fuck = '#';struct Mat {int row,col;};Mat mat[300];bool isCaptial(char ch) {if(ch >= 'A' && ch <= 'Z')return true;elsereturn false;}bool match(char mat1,char mat2) {if(mat[mat1].col == mat[mat2].row)return true;elsereturn false;}int main() {int n;scanf("%d",&n); getchar();char ch;char str[N];for(int i = 1; i <= n; i++) {scanf("%c",&ch);scanf("%d%d",&mat[ch].row,&mat[ch].col);getchar();}mat[fuck].row = 0 , mat[fuck].col = 0;stack<char> st;while(gets(str)) {char top1,top2;int i;int sum = 0;for(i=0; str[i] != '\0'; i++) {if(isCaptial(str[i])) {st.push(str[i]);}else if( str[i] == ')') {top1 = st.top();st.pop();top2 = st.top();st.pop();if(match(top2,top1)) {sum += mat[top2].row * mat[top1].row * mat[top1].col;mat[fuck].row = mat[top2].row;mat[fuck].col = mat[top1].col;st.push(fuck);fuck++;} else {break;}}}if(str[i] != '\0')printf("error\n");elseprintf("%d\n",sum);}return 0;}
- Uva 442 Matrix Chain Multiplication (矩阵连乘)
- poj2246 Matrix Chain Multiplication 矩阵连乘
- UVa 442 Matrix Chain Multiplication(矩阵链乘,模拟栈)
- Matrix Chain Multiplication 矩阵链乘 UVA 442
- UVA 442 Matrix Chain Multiplication (矩阵链乘)
- UVa OJ Matrix Chain Multiplication 矩阵链乘 442
- Matrix Chain Multiplication UVA442 矩阵连乘 stack
- 例题6-3 矩阵链乘(Matrix Chain Multiplication, UVa 442)
- 矩阵链乘(Matrix Chain Multiplication)
- UVa442 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
- H.264编码原理以及I帧B帧P帧
- Android 完美实现图片圆角和圆形(对实现进行分析)
- HDMI之EDID
- 好博客收集
- XML简明教程——文档对象模型——DOM和SAX(二)
- Uva 442 Matrix Chain Multiplication (矩阵连乘)
- 国外程序员整理的机器学习资源大全
- cocos2d-x 3.1.1 学习笔记[17] 关于函数的那些勾当
- socket编程中的超时设置示例详解之二
- 抽象类与接口面试题汇总
- Android - Uri
- FastCGI技术
- What does "ls -l" show?
- hadoop命令学习 (更新中...)