nyoj--18--The Triangle(dp水题)
来源:互联网 发布:火车票网络订票时间 编辑:程序博客网 时间:2024/05/20 15:11
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.
- 样例输入
573 88 1 0 2 7 4 44 5 2 6 5
- 样例输出
30
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define MAX 210int dp[MAX][MAX];int main(){int n;while(scanf("%d",&n)!=EOF){for(int i=1;i<=n;i++){for(int j=1;j<=i;j++)scanf("%d",&dp[i][j]);}for(int i=n-1;i>=1;i--){for(int j=1;j<=n;j++)dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]);}printf("%d\n",dp[1][1]);}return 0;}
0 0
- nyoj--18--The Triangle(dp水题)
- nyoj 18 The Triangle 【经典dp】
- NYOJ 18 The Triangle(简单dp)
- nyoj The Triangle 18 (简单DP)
- NYOJ 18-The Triangle(典型DP)
- NYOJ - The Triangle(经典dp)
- NYOJ 18 The Triangle
- NYOJ 18-The Triangle
- The Triangle(nyoj 18)
- nyoj-18-The Triangle
- NYOJ-18 The Triangle
- NYOJ 18 The Triangle
- The Triangle--nyoj 18
- nyoj 18The Triangle
- NYOJ 18 The Triangle
- NYOJ-18 The Triangle
- nyoj 18 The Triangle
- NYOJ 18 The Triangle
- kinect2.0(二)读取彩色图像
- HDU 5313 Bipartite Graph
- 10.Spring MVC4.1-异步请求处理(包含兼容浏览器的服务器端推送)
- 贪吃蛇小游戏(JAVA)
- UI_触摸事件
- nyoj--18--The Triangle(dp水题)
- opencv 漫水填充运用
- Lowest Common Ancestor in a Binary Tree
- Java 对象集合数据导出到Excel
- 南京学思XSuperNest使用addHeaderView注意事项
- matlab读取视频VideoReader类 mmreader
- hadoop伪分布式安装步骤
- LeetCode:Factorial Trailing Zeroes
- Leetcode 第6题 ZIGZAG后,行列输出