最优矩阵链乘(动态规划dp)POJ 1651 Multiplication Puzzle
2016-10-09 20:18
435 查看
大体题意:
一个n*m的矩阵由n行m列共n*m排列而成。两个矩阵A和B可以相乘当且仅当A的列数等于B的行数。一个n*m的矩阵乘m*p的矩阵,运算量为n*m*p。
矩阵乘法不满足分配律,但满足结合律。因此A*B*C既可以按顺序(A*B)*C也可以按A*(B*C)来进行。假设A、B、C分别是2*3、3*4、4*5的,则(A*B)*C运算量是2*3*4+2*4*5=64,A*(B*C)的运算量是3*4*5*2*3*5=90.显然第一种顺序节省运算量。
给出n个矩阵组成的序列,设计一种方法把他们依次乘起来,使得总的运算量尽量小。假设第i个矩阵A[i]是P[i-1]*P[i]的。
思路:
记忆化搜索:
令dp[i][j]表示从第i 个矩阵 一直乘以到 第j 个矩阵的最优解!
那么我们直接枚举中间的乘号 k,
转移方程就是 dp[i][j] = min{dp[i][k] + dp[k+1][j] + p[i-1]*p[k] *p[j]}
假设第i个矩阵式是p[i-1] * p[i];
边界式 dp[i][i] = 0;
详细见代码:
/**
4
2 3 4 5
ans = 64
3
2 3 4
ans = 24
4
10 100 5 50
ans = 7500
7
30 35 15 5 10 20 25
ans = 15125
**/
[Submit] [Go Back] [Status]
[Discuss]
一个n*m的矩阵由n行m列共n*m排列而成。两个矩阵A和B可以相乘当且仅当A的列数等于B的行数。一个n*m的矩阵乘m*p的矩阵,运算量为n*m*p。
矩阵乘法不满足分配律,但满足结合律。因此A*B*C既可以按顺序(A*B)*C也可以按A*(B*C)来进行。假设A、B、C分别是2*3、3*4、4*5的,则(A*B)*C运算量是2*3*4+2*4*5=64,A*(B*C)的运算量是3*4*5*2*3*5=90.显然第一种顺序节省运算量。
给出n个矩阵组成的序列,设计一种方法把他们依次乘起来,使得总的运算量尽量小。假设第i个矩阵A[i]是P[i-1]*P[i]的。
思路:
记忆化搜索:
令dp[i][j]表示从第i 个矩阵 一直乘以到 第j 个矩阵的最优解!
那么我们直接枚举中间的乘号 k,
转移方程就是 dp[i][j] = min{dp[i][k] + dp[k+1][j] + p[i-1]*p[k] *p[j]}
假设第i个矩阵式是p[i-1] * p[i];
边界式 dp[i][i] = 0;
详细见代码:
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 100 + 10; const int inf = 0x3f3f3f3f; int a[maxn]; int dp[maxn][maxn]; int dfs(int l,int r){ int& ans = dp[l][r]; if (ans != -1)return ans; if (l == r)return ans = 0; if (l+1 == r){ return ans = a[l-1]*a[l]*a[r]; } ans = inf; for (int k = l; k <= r; ++k){ ans = min(ans,dfs(l,k) + dfs(k+1,r) + a[l-1]*a[k]*a[r]); } return ans; } int main(){ int n; while(scanf("%d",&n) == 1){ for (int i = 0; i < n; ++i){ scanf("%d",&a[i]); } memset(dp,-1,sizeof dp); printf("%d\n",dfs(1,n-1)); } return 0; }
/**
4
2 3 4 5
ans = 64
3
2 3 4
ans = 24
4
10 100 5 50
ans = 7500
7
30 35 15 5 10 20 25
ans = 15125
**/
Multiplication Puzzle
The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the product of the number on the card taken and the numbers on the cards on the left and on the right of it. It is not allowed to take out the first and the last card in the row. After the final move, only two cards are left in the row. The goal is to take cards in such order as to minimize the total number of scored points. For example, if cards in the row contain numbers 10 1 50 20 5, player might take a card with 1, then 20 and 50, scoring 10*1*50 + 50*20*5 + 10*50*5 = 500+5000+2500 = 8000 If he would take the cards in the opposite order, i.e. 50, then 20, then 1, the score would be 1*50*20 + 1*20*5 + 10*1*5 = 1000+100+50 = 1150. Input The first line of the input contains the number of cards N (3 <= N <= 100). The second line contains N integers in the range from 1 to 100, separated by spaces. Output Output must contain a single integer - the minimal score. Sample Input 6 10 1 50 50 20 5 Sample Output 3650 Source Northeastern Europe 2001, Far-Eastern Subregion |
[Discuss]
相关文章推荐
- poj 1651 Multiplication Puzzle -- (动态规划,区间dp)
- poj 1651 Multiplication Puzzle(区间dp 矩阵链乘法)
- POJ 1651 - Multiplication Puzzle(区间DP,矩阵链乘三种模版详解)
- POJ 1651 Multiplication Puzzle DP 类似矩阵链
- 动态规划之划分动态规划:矩阵链乘 poj 1651 Multiplication Puzzle
- 【POJ 1651】【区间DP 矩阵链乘的变形】Multiplication Puzzle【一串数字,除了头尾不能动,每次取个数字,它与左右相邻数字的乘积为其价值,求价值和最小】
- POJ 1651 (最优矩阵链乘)
- nyoj 536 开心的mdd(最优矩阵链乘)dp
- DP:Multiplication Puzzle(POJ 1651)
- POJ 3342 - Party at Hali-Bula 树形DP+最优解唯一性判断
- poj 1651 Multiplication Puzzle【区间DP】
- POJ 1651 Multiplication Puzzle(区间dp)
- Mark一下, dp状态转移方程写对,但是写代码都错,poj 1651 poj 1179
- poj1651(区间dp)
- 1154 能量项链 区间dp(最优矩阵链乘)
- uva348 最优矩阵链乘 经典区间dp
- poj 动态规划DP - 1456 Supermarket
- POJ-1080-Human Gene Functions-LCS变体,动态规划,DP
- POJ 1651 Multiplication Puzzle(区间DP)
- poj 动态规划DP - 1953 World Cup Noise