nyoj 18 The Triangle 【经典dp】
2015-05-07 20:33
363 查看
The Triangle
时间限制:1000 ms | 内存限制:65535 KB难度:4
描述
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
数塔模型:
#include<stdio.h> #include<string.h> #include<stdlib.h> int max(int x,int y) { return x>y?x:y; } int dp[110][110]; int main() { int n,m,i,j; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { scanf("%d",&dp[i][j]); } } for(i=n-1;i>=1;i--) { for(j=1;j<=i;j++) { dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]); } } printf("%d\n",dp[1][1]); } return 0; }
[/code]
相关文章推荐
- NYOJ 18. The triangle(基础DP)
- nyoj 18The Triangle
- NYOJ 651 Cut the rope(DP, 经典的整数划分问题)
- NYOJ题目18-The Triangle(经典dp)
- NYOJ - 开心的小明(经典dp)
- POJ1163 The Triangle 【DP】
- pku 1163 dp TheTriangle 解题报告
- nyoj18 The Triangle(dp)
- ZOJ 3647 Gao the Grid dp,思路,格中取同一行的三点,经典 难度:3
- 经典问题三.【环形区间dp】 项链 nyoj 460
- NYOJ 44 子串和 (经典的dp问题)
- HDU1081 - To The Max - 状态压缩DP【经典】
- poj 1163 The Triangle 因为这个,发现DP很有意思
- NYOJ90 整数划分(经典递归和dp)
- NYOJ 18-The Triangle(典型DP)
- NYOJ 79 拦截导弹 (经典dp) 最长上升子序列 LIS
- NYOJ252. 01串(经典DP)
- To The Max_hdu_1081(经典DP).java
- ACM POJ 1163 The Triangle DP
- NYOJ 石子合并(一)经典区间DP