nyoj--18--The Triangle(dp水题)
2015-11-19 22:06
337 查看
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<algorithm> using namespace std; #define MAX 210 int 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; }
相关文章推荐
- 第一个Sprint冲刺第九天
- UI_触摸事件
- JqueryEasyUI引入,及初试
- ajax请求webservice
- 10.Spring MVC4.1-异步请求处理(包含兼容浏览器的服务器端推送)
- HDU 5313 Bipartite Graph
- 贪吃蛇小游戏(JAVA)
- StateMachine
- 使用Node.js的socket.io模块开发实时web程序
- 二叉树的中序遍历(lintcode)(递归和非递归)
- Android接收彩信时解析PDU的过程记录
- 教你如何开发VR游戏系列教程五:UI 交互
- Python机器学习1-库安装
- 暂留2
- 局部内部类+外部类访问final变量+final 回顾
- 南大软院大神养成计划--HTML和CSS基础课程
- Linux\CentOS系统下的服务器搭建,下载编译环境,安装vsFtpd、nginx、MySQL、JDK、Tomcat、PHP
- kinect2.0(二)读取彩色图像
- hdu--1226(bfs+记录路径)
- Java 数组