UVa 348 Optimal Array Multiplication Sequence (DP 最优矩阵链乘)
来源:互联网 发布:二手车价格评估软件 编辑:程序博客网 时间:2024/06/05 19:42
题意 求给定数目矩阵的最优链乘 并输出路径
矩阵链乘在小白P170有讲解 也是经典的动态规划 有了转移方程题目就好做了 设d[i][j]为矩阵i到矩阵j的最优链乘 初始状态d[i][i]=0 k为i,j之间的一个矩阵 x[i],y[i]分别表示第i个矩阵的行和列 则有d[i][j]=min{d[i][k]+d[k+1][j]+x[i]*y[k]*y[j]}
感觉这题比较难的就是路径打印了 仔细观察一下结构 其实也不难 记录每个k值 直接递归就行了
#include<cstdio> #include<cstring> using namespace std; #define maxn 11 #define INF 0x3f3f3f3f #define t dp(i,k)+dp(k+1,j)+x[i]*y[k]*y[j] int d[maxn][maxn],pre[maxn][maxn],x[maxn],y[maxn],n; int dp(int i,int j) { if(d[i][j]<INF) return d[i][j]; for(int k=i; k<j; ++k) if(d[i][j]>t) { d[i][j]=t; pre[i][j]=k; } return d[i][j]; } void print(int i,int j) { int k=pre[i][j]; if(k) { printf("("); print(i,k); printf(" x "); print(k+1,j); printf(")"); } else { printf("A%d",i); } } int main() { int k=1; while(scanf("%d",&n),n) { memset(d,0x3f,sizeof(d)); memset(pre,0,sizeof(pre)); for(int i=1; i<=n; ++i) { scanf("%d%d",&x[i],&y[i]); d[i][i]=0; } dp(1,n); printf("Case %d: ",k); print(1,n); printf("\n"); k++; } return 0; }
Optimal Array Multiplication Sequence
Given two arrays A and B, we can determine the array C = A B using the standard definition of matrix multiplication:
The number of columns in the A array must be the same as the number of rows in the B array. Notationally, let's say that rows(A) and columns(A) are the number of rows and columns, respectively, in the A array. The number of individual multiplications required to compute the entire C array (which will have the same number of rows as A and the same number of columns as B) is then rows(A)columns(B) columns(A). For example, if A is a array, and B is a array, it will take , or 3000 multiplications to compute the C array.
To perform multiplication of more than two arrays we have a choice of how to proceed. For example, if X, Y, and Z are arrays, then to compute X Y Z we could either compute (X Y) Z or X (Y Z). Suppose Xis a array, Y is a array, and Z is a array. Let's look at the number of multiplications required to compute the product using the two different sequences:
(X Y) Z
- multiplications to determine the product (X Y), a array.
- Then multiplications to determine the final result.
- Total multiplications: 4500.
X (Y Z)
- multiplications to determine the product (Y Z), a array.
- Then multiplications to determine the final result.
- Total multiplications: 8750.
Clearly we'll be able to compute (X Y) Z using fewer individual multiplications.
Given the size of each array in a sequence of arrays to be multiplied, you are to determine an optimal computational sequence. Optimality, for this problem, is relative to the number of individual multiplications required.
Input
For each array in the multiple sequences of arrays to be multiplied you will be given only the dimensions of the array. Each sequence will consist of an integer N which indicates the number of arrays to be multiplied, and then N pairs of integers, each pair giving the number of rows and columns in an array; the order in which the dimensions are given is the same as the order in which the arrays are to be multiplied. A value of zero for N indicates the end of the input. N will be no larger than 10.
Output
Assume the arrays are named . Your output for each input case is to be a line containing a parenthesized expression clearly indicating the order in which the arrays are to be multiplied. Prefix the output for each case with the case number (they are sequentially numbered, starting with 1). Your output should strongly resemble that shown in the samples shown below. If, by chance, there are multiple correct sequences, any of these will be accepted as a valid answer.
Sample Input
31 55 2020 135 1010 2020 35630 3535 1515 55 1010 2020 250
Sample Output
Case 1: (A1 x (A2 x A3))Case 2: ((A1 x A2) x A3)Case 3: ((A1 x (A2 x A3)) x ((A4 x A5) x A6))
- UVA 348 Optimal Array Multiplication Sequence 最优矩阵链乘 dp经典
- UVA 348 Optimal Array Multiplication Sequence 最优矩阵链乘 区间DP
- UVa 348 Optimal Array Multiplication Sequence (DP 最优矩阵链乘)
- UVa 348 Optimal Array Multiplication Sequence (DP 最优矩阵链乘)
- UVA - 348 Optimal Array Multiplication Sequence 最优矩阵连乘
- UVA 348 Optimal Array Multiplication Sequence(最优矩阵链乘)
- 【UVA】348-Optimal Array Multiplication Sequence(矩阵链乘)
- UVa 348 Optimal Array Multiplication Sequence (区间DP&矩阵链乘,MCM)
- UVA - 348 Optimal Array Multiplication Sequence (最优矩阵连乘)
- uva 348 Optimal Array Multiplication Sequence (DP)
- UVa 348 Optimal Array Multiplication Sequence(dp)
- Optimal Array Multiplication Sequence - UVa 348 dp
- UVA 348 & ZOJ1276 Optimal Array Multiplication Sequence(dp , 矩阵链相乘问题)
- UVA 348 Optimal Array Multiplication Sequence(区间dp)
- uva 348 Optimal Array Multiplication Sequence(区间dp)
- UVA 348 Optimal Array Multiplication Sequence 区间DP
- UVA 348 Optimal Array Multiplication Sequence (区间DP)
- TOJ 2118 Optimal Array Multiplication Sequence 矩阵连乘 我会做DP了!
- 谷歌眼镜的技术原理
- 读研的资格。。。。
- poj1459 最大流 Power Network
- Ticket 服务: 一种经济的分布式唯一主键生成方案
- 细说linux挂载——mount,及其他
- UVa 348 Optimal Array Multiplication Sequence (DP 最优矩阵链乘)
- Linux netstat命令详解
- 5-linux学习笔记之-----curses
- 7.14 虚函数
- Sum it up
- 取消单选按钮选中
- Python模块学习——logging
- 编写自己的异常类
- PHPer 发展之路