POJ 1163 The Triangle
2017-02-20 13:06
309 查看
The Triangle
Description
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 47202 | Accepted: 28561 |
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. InputYour 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 > 1but <= 100. The numbers in the triangle, all integers, are between 0 and 99.OutputYour program is to write to standard output. The highest sum is written as an integer.Sample Input
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5Sample Output
30
/* 数字三角形- -动态规划入门必讲的题了- -*/#include "iostream"#include "algorithm"using namespace std;int main() { int n; int dp[101][101]; cin >> n; for(int i=1;i<=n;i++) for (int j = 1; j <= i; j++) { cin >> dp[i][j]; } int * MaxSum = dp; for (int i = n - 1; i >= 1; i--) for (int j = 1; j <= i; j++) { MaxSum[j] = max(MaxSum[j], MaxSum[j + 1]) + dp[i][j]; } cout << MaxSum[1] << endl; return 0;}
相关文章推荐
- POJ 1163 The Triangle
- poj 1163 The Triangle
- POJ 1163 The Triangle【DP】递归和递推
- POJ 1163 The Triangle
- POJ - 1163 The Triangle(动态规划)
- poj 1163 The Triangle 记忆化搜索
- POJ 1163 The Triangle (DP)
- POJ 1163 The Triangle(简单动态规划)
- (转)POJ 1163 The Triangle 解题报告
- poj-1163-The Triangle
- POJ 1163 The Triangle
- POJ 1163 The Triangle
- POJ 1163 The Triangle【DP】
- poj 1163 The Triangle (记忆化搜索)
- POJ 1163-The Triangle
- POJ-1163 The Triangle 「数字三角形」(递推)
- POJ 1163 The Triangle(入门动规)
- POJ 1163 The Triangle
- OpenJudge/Poj 1163 The Triangle
- POJ 1163:The Triangle(递推)