poj2246 Matrix Chain Multiplication 矩阵连乘
来源:互联网 发布:知乎指数 编辑:程序博客网 时间:2024/06/02 23:59
Description
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
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 } Line = Expression Expression = Matrix | "(" Expression Expression ")"Matrix = "A" | "B" | "C" | ... | "X" | "Y" | "Z"
Output
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
题意:先输入一个n,然后输入n个矩阵。接着就是输入矩阵算式。需要我们编程计算这个矩阵算式需要计算几次乘法。如果这个算式不能计算,就输出error,不然就输出计算次数。
解析:1.因为矩阵有行跟列,所以最好要结构体来保存矩阵。
2.如何表明一个矩阵,我的想法是用字母的下标来表示。如h[a-'A'].row
3.如何来计算算是的优先顺序,这个是这个题目的难点。我的做法是用栈计算
如果是'(',就跳过。如果是字母,我们就进栈。是')',就判断在栈顶的前两个能否相乘,如果l[top].r!=l[top-1].c,就是不能相乘,如果能相乘,次数等于l[top-1].c*l[top-1].r*l[top].c。矩阵变成行是l[top-1].c和列是l[top].r。
代码:如下参考
#include <iostream>
#include <string.h>
using namespace std;
struct matrix
{
int b,c;
}h[26],l[20];
int main()
{
int n,i,m,top,sum;
char f[100],a;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a;
cin>>h[a-'A'].b>>h[a-'A'].c;
}
while(cin>>f)
{
sum=0;top=-1;
for(i=0;i<strlen(f);i++)
{
if(f[i]=='(')
continue;
else if(f[i]==')')
{
if(l[top].b==l[top-1].c)
{
sum+=l[top-1].b*l[top-1].c*l[top].c;
l[top-1].c=l[top].c;
top--;
}
else
{
cout<<"error"<<endl;
break;
}
}
else
{
l[++top].b=h[f[i]-'A'].b;
l[top].c=h[f[i]-'A'].c;
}
}
if(top==0)
cout<<sum<<endl;
}
return 0;
}
- poj2246 Matrix Chain Multiplication 矩阵连乘
- poj2246 - Matrix Chain Multiplication
- Uva 442 Matrix Chain Multiplication (矩阵连乘)
- Matrix Chain Multiplication UVA442 矩阵连乘 stack
- 矩阵链乘(Matrix Chain Multiplication)
- UVa442 Matrix Chain Multiplication(矩阵链乘)
- poj2246 Matrix Chain Multiplication (栈)
- UVa442 Matrix Chain Multiplication(矩阵链乘)
- UVa442 Matrix Chain Multiplication(矩阵链乘)java实现
- UVa 442 Matrix Chain Multiplication(矩阵链乘,模拟栈)
- Matrix Chain Multiplication 矩阵链乘 UVA 442
- UVA 442 Matrix Chain Multiplication (矩阵链乘)
- UVa OJ Matrix Chain Multiplication 矩阵链乘 442
- UVa442 例题6-3 矩阵链乘(Matrix Chain Multiplication)
- 例题6-3 矩阵链乘(Matrix Chain Multiplication, UVa 442)
- ZOJ 1602 Multiplication Puzzle(矩阵连乘)
- POJ 1651 Multiplication Puzzle (矩阵连乘)
- 栈对于表达式求值的特殊作用&&UVa442 Matrix Chain Multiplication(矩阵链乘)的理解与解析
- nbtscan局域网扫描的原理
- 自定义windows休眠文件的路径
- 工业以太网
- 无线传感网络国内外研究发展状况
- html学习心得
- poj2246 Matrix Chain Multiplication 矩阵连乘
- shell中字符串的截取
- epoll使用例子
- Java中String StringBuffer StringBuilder比较
- Objective-C的一些语言点梳理
- EPOLL使用注意
- epoll 使用
- epoll去实现一个服务器
- C# ListView用法详解