nyoj The Triangle 18 (简单DP)
2015-10-08 11:37
225 查看
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
//题意: //给你一个n行的数塔,问从第一行走到最后一行最多要花销多少能量 //并且上一行只能与它下一行的相邻的两个数相加 //解题思路: //从下往上加,然后不断更新他们的值 #include<stdio.h> #define MAX(a,b) (a>b?a:b) int a[110][110]; int main() { int n,i,j; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { scanf("%d",&a[i][j]); } } for(i=n-1;i>=1;i--) { for(j=1;j<=i;j++) { a[i][j]=MAX(a[i][j]+a[i+1][j],a[i][j]+a[i+1][j+1]); } } printf("%d\n",a[1][1]); } return 0; }
相关文章推荐
- Android OkHttp完全解析 是时候来了解OkHttp了
- DB---数据库中Schema的理解
- VMware下centos桥接模式静态ip配置
- oracle中的exists 和not exists
- Tomcat version 7.0 only supports J2EE 1.2, 1.3, 1.4, and Java EE 5 and 6 Web
- ViewController的加载的生命周期
- 无法通过json传递字符串在sqlite3中进行汉字字符插入和查询
- JavaScript 中 onload 事件绑定多个方法
- ACE主动对象模式(1)
- 你知道Parallels desktop使用方法吗
- Android实现的状态栏定制和修改方法
- 多对一单向关联关系理解与实践
- 网络封包过滤之分层服务提供者(LSP)
- gcc的三个阶段
- UVA_548: Tree
- 【Qt】QTableView表格滚动条样式实现QStyleSheet
- 巨坑OC笔试题!!!
- NES模拟器开发-PPU笔记
- 编写一个守护进程
- 1005. Spell It Right (20)