三角形最长路径
2013-07-07 16:50
148 查看
描述
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.
输入Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.输出Your program is to write to standard output. The highest sum is written as an integer.样例输入
样例输出
解题思路:
在解本题的时候,我习惯性的想到利用最长递增子序列等问题的求解方式,即要求i到j行的距离A[i,j],需要求到A[i,j-1]即i到j-1行的路径最长,但是通过这种思路,并不能够
找到一个对应的等式。后来通过借鉴别人的思路,可以求出到达每个点的最长路径,再求出其最长路径,再由某点i,j,能够到达该点的上一行一定是F[i-1,j-1]或者F[i-1,j]。比较其大值加上该点的长度即可。
设某点的路径数值为M[i,j]
F[i,j]=Max(F[i-1,j-1],F[i-1,j])+M[i,j]
View Code
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.
输入Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.输出Your program is to write to standard output. The highest sum is written as an integer.样例输入
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
样例输出
30
解题思路:
在解本题的时候,我习惯性的想到利用最长递增子序列等问题的求解方式,即要求i到j行的距离A[i,j],需要求到A[i,j-1]即i到j-1行的路径最长,但是通过这种思路,并不能够
找到一个对应的等式。后来通过借鉴别人的思路,可以求出到达每个点的最长路径,再求出其最长路径,再由某点i,j,能够到达该点的上一行一定是F[i-1,j-1]或者F[i-1,j]。比较其大值加上该点的长度即可。
设某点的路径数值为M[i,j]
F[i,j]=Max(F[i-1,j-1],F[i-1,j])+M[i,j]
public static int BiggestSum(int[,] M, int len) { int[,] F = new int[len+1, len+1]; int biggest = 0; for (int i = 0; i <= len; i++) for (int j = 0; j <= len; j++) F[i, j] = 0; for (int i = 1; i <= len; i++) for (int j = 1; j <= i; j++) { F[i, j] = Math.Max(F[i - 1, j - 1], F[i - 1, j]) + M[i, j]; if (F[i, j] > biggest) biggest = F[i, j]; } return biggest; }
View Code
相关文章推荐
- ACM-动态规划21-三角形最长路径问题
- 【java】数字三角形最长路径
- 字串的连接最长路径查找
- Arbitrage(bellman,最长路径)
- HDU 6201 transaction transaction transaction(SPFA算法求最长路径)
- zoj 3088 spfa 最短&最长路径
- 字串的连接最长路径查找
- UVA 103 Stacking Boxes (dp + DAG上的最长路径 + 记忆化搜索)
- Triangle 三角形求最小路径和 @leetcode
- EularProject 67: 三角形数字矩阵的最大路径
- uva10131 Is Bigger Smarter?(经典DP,最长上升子序列,注意保存路径部分)
- uva 103 Stacking Boxes(DAG上的最长路径)
- OpenJudge_P7625 三角形最佳路径问题(DP)
- 树上最长单色路径
- HDU 1160 FatMouse's Speed (最长上升子序列+路径输出)
- 网络流24题(06)最长递增子序列问题(最多不相交路径 + 最大流)
- 最长非降 nlogn 带路径标记
- 动态规划--三角形最佳路径
- [DP] 51 Nod 1274——最长递增路径
- 【GDOI2017第二轮模拟day1】最长路径(性质题,容斥,组合数学)