POJ 1163 The Triangle(DP 数塔问题)
来源:互联网 发布:郭德纲经典相声 知乎 编辑:程序博客网 时间:2024/06/05 22:53
The Triangle
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45125 Accepted: 27270
Description
73 88 1 02 7 4 44 5 2 6 5(Figure 1)
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
573 88 1 0 2 7 4 44 5 2 6 5
Sample Output
30
Source
IOI 1994
很经典的DP问题,数塔问题,从下往上进行动态规划。
下面是AC代码:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[105][105];int dp[105][105];int main(){ int n; while(~scanf("%d",&n)) { for(int i=0; i<n; i++) { for(int j=0;j<=i;j++) { scanf("%d",&a[i][j]); } } for(int i=n-1;i>=0;i--) { dp[n-1][i]=a[n-1][i]; } for(int i=n-2;i>=0;i--) { for(int j=0;j<=i;j++) dp[i][j]=a[i][j]+max(dp[i+1][j],dp[i+1][j+1]); } printf("%d\n",dp[0][0]); } return 0;}
0 0
- POJ 1163 The Triangle(DP 数塔问题)
- POJ 1163 The Triangle(数塔模型dp)
- POJ The Triangle (dp数塔)
- POJ 1163 The Triangle (数塔)
- POJ 3176-Cow Bowling/POJ 1163-The Triangle(简单DP-数塔)
- HLG 1004 The Triangle(数塔问题DP)
- POJ 1163 The Triangle (简单DP)
- poj - 1163 - The Triangle(dp)
- POJ 1163 The Triangle (DP)
- POJ 1163 The Triangle(DP)
- POJ 1163 The Triangle(dp)
- POJ 1163 The Triangle(基础DP)
- POJ 1163&& 3176 The Triangle(DP)
- poj 1163 the triangle(dp)
- POJ 1163 The Triangle (DP)
- POJ 1163: The Triangle(dp)
- POJ 1163 The Triangle (DP)
- POJ 1163 The Triangle【DP】
- 兰州烧饼 南阳理工ACM 题目779
- JSP基础
- pom文件详解
- 傅里叶各种变换术语
- 敏感词的字典树匹配(lua版)
- POJ 1163 The Triangle(DP 数塔问题)
- Unity3d 从零搭建android调试环境
- 《鸟叔-视频》(6-1)
- 记百度地图jar包冲突问题com.android.build.api.transform.TransformException:com.android.ide.commom.process.Proce
- 工作中做着自己不敢做的事情——痛苦并且快乐着!
- 二叉排序树
- 【POJ】1061 - 青蛙的约会(扩展欧几里得)
- JSTL
- HDU 5769 Substring (后缀数组)