POJ 1163 The Triangle数塔 动态规划
来源:互联网 发布:吉林省典恒网络怎么样 编辑:程序博客网 时间:2024/06/07 23:39
The Triangle
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.
Input
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.
Output
Your 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 5
Sample Output
30
#include<iostream>#include<cstdio>using namespace std;int num[1010][1010];int *dps;int n;int dp(){ for(int i=n-1;i>=1;--i) for(int j=1;j<=i;++j) dps[j]=max(dps[j],dps[j+1])+num[i][j];//已经保存的上一行对应值 return dps[1];}int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) for(int t=1;t<=i;t++) scanf("%d",&num[i][t]);dps=num[n];//指向最后一行的指针 dp(); cout<<dps[1]<<endl;}
- POJ 1163 The Triangle数塔 动态规划
- POJ-1163-The Triangle-动态规划
- poj 1163 The Triangle 线性动态规划
- poj 1163 The Triangle (动态规划)
- POJ 1163 The Triangle (动态规划)
- poj 动态规划DP - 1163 The Triangle
- poj 1163 The Triangle 动态规划
- POJ 1163:The Triangle(动态规划)
- poj-1163-The Triangle-动态规划dp
- The Triangle--动态规划经典问题--数塔问题
- poj 1163 The Triangle (动态规划入门题)
- 动态规划入门-POJ 1163-The Triangle(数字三角形)
- POJ-1163(The Triangle)动态规划基础题
- poj 1163-小白算法练习 The Triangle 动态规划
- 1163 The Triangle 动态规划
- POJ 1163 The Triangle (数塔)
- 动态规划(1)1163 The Triangle
- POJ 1163 The Triangle & POJ 3176 Cow Bowling(DP动态规划)
- 点击文本输入控件,默认文本消失,点击其他地方再次恢复
- 免费批量修改图片MD5软件 图片处理防和谐软件
- C#中静态变量与非静态变量的区别
- Android Bitmap 知识点梳理
- Android 关闭多个视图的方法
- POJ 1163 The Triangle数塔 动态规划
- 约瑟夫问题
- 批量添加 或修改文件后缀名
- PAT考试重点真题选做
- C语言中的数据类型转化
- 开启VPN的一些问题解决方案
- 171208之Oracle总结(一)
- 669. Trim a Binary Search Tree
- BZOJ1125: [POI2008]Poc