【POJ】[3176]Cow Bowling
2016-07-28 09:56
281 查看
Cow Bowling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 17309 | Accepted: 11558 |
Description
The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this:7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
Then the other cows traverse the triangle starting from its tip and moving "down" to one of the two diagonally adjacent cows until the "bottom" row is reached. The cow's score is the sum of the numbers of the cows visited along the way. The cow with the highest score wins that frame.
Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable.
Input
Line 1: A single integer, NLines 2..N+1: Line i+1 contains i space-separated integers that represent row i of the triangle.
Output
Line 1: The largest sum achievable using the traversal rulesSample Input
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
Sample Output
30
Hint
Explanation of the sample:7 * 3 8 * 8 1 0 * 2 7 4 4 * 4 5 2 6 5
The highest score is achievable by traversing the cows as shown above.
经典dp问题
从下面向上有
dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1])
所以最后结果就会是dp[0][0]
#include<stdio.h> #include<algorithm> using namespace std; int map[352][352]; int main() { int n; while(scanf("%d",&n)!=EOF) { for(int i=0; i<n; i++) for(int j=0; j<=i; j++) scanf("%d",&map[i][j]); if(n==1) { printf("%d\n",map[0][0]); continue; } for(int i=n-2; i>=0; i--) { for(int j=0; j<=i; j++) { map[i][j]+=max(map[i+1][j],map[i+1][j+1]); } } printf("%d\n",map[0][0]); } return 0; }
题目地址:【POJ】[3176]Cow Bowling
查看原文:http://www.boiltask.com/blog/?p=1447
相关文章推荐
- 文件系统初步
- 物联网项目开发编程语言一览
- MySQL 配置优化
- AppBarLayout源码解读
- 【OpenJudge】c语言_计算线段长度
- 高程提取为XYZ坐标教程
- Criteria关联查询
- linux下C语言编程操作MySQL数据库
- Codeforces Round #363 (Div. 2) A. Launch of Collider
- Linux kernel的 Makefile和Kconfig以及Make menuconfig的关系
- 【HDU5739 2016 Multi-University Training Contest 2F】【cdq分治+并查集做法 or 点双连通做法】Fantasia 每点删除后联通块权值和的积
- Java Web学习(23): JSTL学习(一)
- 校内ACM上出现Presentation Error的一点认识
- 数独
- poj 2388 堆排序
- Spring4笔记----使用外部属性文件配置 bean
- JS 中document.URL 和 windows.location.href 的区别
- IPv4与IPv6数据报格式详解
- SQL Server 存储过程遇到“表 '#TT' 没有标识属性。无法执行 SET 操作”错误
- JavaScript中的上溢、下溢和被零整除