ZOJ 1602 Multiplication Puzzle(矩阵连乘)
来源:互联网 发布:vb计算器代码 编辑:程序博客网 时间:2024/05/17 01:44
题意:给出一排卡,每次能拿走除了第一张和最后一张之外的任何卡,拿走卡i之后要加上卡i和卡i-1和卡i+1的乘积,直到剩下第一张和最后一张为止,求最少的乘积和.
设dp[i][j]为拿走i..j之间卡的最少乘积和,那么答案就是dp[1][N]
dp[i][j] = min{dp[i][k[ + dp[k][j] + C[i] * C[k] * C[j]] | i< k < j}
base cases: dp[i][i] = 0, dp[i][i + 1] = 0.
#include <cstdio>#include <memory.h>#include <algorithm>using namespace std;const int MAX = 105;int main(int argc, char const *argv[]){int dp[MAX][MAX];int cards[MAX];int N;while(scanf("%d", &N) == 1){memset(dp, 0x20, sizeof(dp));for(int i = 1; i <= N; ++i){scanf("%d", &cards[i]);dp[i][i] = dp[i][i + 1] = 0;}for(int p = 2; p < N; ++p){for(int i = 1; i <= N && i + p <= N; ++i){int j = i + p;for(int k = i; k <= j; ++k){dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + cards[i] * cards[k] * cards[j]);}}}printf("%d\n", dp[1][N]);}return 0;}
0 0
- ZOJ 1602 Multiplication Puzzle(矩阵连乘)
- POJ 1651 Multiplication Puzzle (矩阵连乘)
- POJ 1651 Multiplication Puzzle (区间dp 矩阵连乘)
- zoj 1602 Multiplication Puzzle
- ZOJ 1602 Multiplication Puzzle
- zoj 1602 Multiplication Puzzle
- Multiplication Puzzle(区间DP:类似矩阵连乘问题的DP模板)
- POJ-1651 Multiplication Puzzle 矩阵连乘问题(区间dp)
- zoj 2974 矩阵连乘
- poj2246 Matrix Chain Multiplication 矩阵连乘
- ZOJ 1602 Multiplication Puzzle (DP)
- POJ1651:Multiplication Puzzle(区间DP 最优矩阵链乘)
- poj1651-Multiplication Puzzle-区间dp/矩阵链乘
- poj 1651 Multiplication Puzzle 矩阵链乘问题
- POJ1651 Multiplication Puzzle —— DP 最优矩阵链乘
- Uva 442 Matrix Chain Multiplication (矩阵连乘)
- UVA - 348 Optimal Array Multiplication Sequence 最优矩阵连乘
- Matrix Chain Multiplication UVA442 矩阵连乘 stack
- C++知识点
- Codeforces April Fools Day Contest 2014(附官方题解)
- 腾讯股价15天跌111港元 分析师:业务转型风险
- Java(异常)
- 记录一下我的腾讯和百度两次面试经历
- ZOJ 1602 Multiplication Puzzle(矩阵连乘)
- 字符串的匹配和查找
- 在javaweb开发时,在jsp中不同语言的取值
- LaTeX之表格中强制换行
- IO之同步和异步
- 项目二。2
- 浅谈android的selector背景选择器
- 【LeetCode】Single Number
- 字符串的替换,分割和连接