POJ 3176 Cow Bowling
来源:互联网 发布:广东网络干培训学院 编辑:程序博客网 时间:2024/06/07 03:08
Cow Bowling
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 02 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, N
Lines 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 rules
Sample 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(动态规划)问题
未完待续。。。
- POJ 3176 COW BOWLING
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- Poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- poj 3176 cow bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- ArrayList源码解析
- DSP移植-OTSU算法
- JavaScript编码规范
- 采集(file_get_contents)
- process launch failed: failed to get the task for process 7680
- POJ 3176 Cow Bowling
- unity 读写sd卡
- SDUT 最少拦截系统 2075
- 23种设计模式之单例模式
- C++引用函数
- Orthogonal Matching Pursuit(OMP)正交匹配追踪算法学习笔记
- 华为OJ 初级:DNA序列
- curl进行传值(post)
- 5-2 最长连续递增子序列