zoj-1094Matrix Chain Multiplication(栈来实现矩阵相乘)
来源:互联网 发布:淘宝品牌代理加盟 编辑:程序博客网 时间:2024/05/28 23:08
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 nextn 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
需要对字符进行处理 如果是'('就跳过 如果是')'就将)前的两个矩阵取出 判断先前的矩阵的行数与后一个的矩阵的列数是否相同 如果不同就输出error 再将乘之后的矩阵继续放回栈中
#include<iostream>#include<string>#include<cstring>#include<stack>#include<map>using namespace std;struct node{int l,r;};int main(){ ios::sync_with_stdio(false); map<char,node> m; int n;char a; cin>>n; for(int i=1;i<=n;i++) { cin>>a; cin>>m[a].l>>m[a].r; } string s; while(cin>>s) { stack<node> u; int count=0; int i; for(i=0;i<s.size();i++) { if(s[i]=='(')continue; else if(s[i]==')') { node p,q; p=u.top(); u.pop(); q=u.top(); u.pop(); if(p.l!=q.r) { cout<<"error"<<endl; break; } count+=q.l*p.l*p.r; node v={q.l,p.r}; u.push(v); } else { u.push(m[s[i]]); } } if(i==s.size()) { cout<<count<<endl; } } return 0;}
- zoj-1094Matrix Chain Multiplication(栈来实现矩阵相乘)
- POJ 2246/ ZOJ 1094 : Matrix Chain Multiplication - 矩阵相乘,模拟
- zoj - 1094 - Matrix Chain Multiplication
- zoj-1094-Matrix Chain Multiplication
- zoj 1094 Matrix Chain Multiplication
- ZOJ 1094 Matrix Chain Multiplication
- ZOJ 1094 Matrix Chain Multiplication
- ZOJ-1094-Matrix Chain Multiplication
- DP8 矩阵链相乘 Matrix Chain Multiplication @geeksforgeeks
- UVa442 Matrix Chain Multiplication(矩阵链乘)java实现
- 算法之动态规划-矩阵链相乘(matrix-chain multiplication)
- UVa 442 - Matrix Chain Multiplication(zoj 1094)
- ZOJ-1094,POJ-2246 Matrix Chain Multiplication
- hdu 4920 Matrix multiplication (矩阵相乘)
- hdoj Matrix multiplication 4920 (矩阵相乘)
- 【HDU】4920 - Matrix multiplication(矩阵相乘)
- POJ3318:Matrix Multiplication(矩阵相乘)
- UVa 442/HDU 1082/ZOJ 1094 Matrix Chain Multiplication(模拟&栈)
- leetcode -- 125. Valid Palindrome 【有效的回文 + 带条件的双指针】
- linux实时系统阵营
- Attempted relative import in non-package
- 笔记1:函数的概述与递归函数
- mybaits 更新choose标签条件Y加了单引号报错
- zoj-1094Matrix Chain Multiplication(栈来实现矩阵相乘)
- CodeForces
- Android应用层View绘制流程与源码分析
- 暑期集训之最小公倍数
- MySQL入门之创建、修改、删除、查看数据库
- python实现linux下的简单进程监控
- HDU2089:不要62(数位DP)
- 如何在Windows 10中安装XGBoost
- mysql统计每分钟增删改查语句次数