POJ 3176 Cow Bowling
2016-07-29 20:11
387 查看
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 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, 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
57
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30Hint
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(最简单DP题)
- POJ3176——DP——Cow Bowling
- POJ 3176:Cow Bowling
- 【poj 3176】Cow Bowling 题意&题解&代码(C++)
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling(基础dp)
- POJ 3176 Cow Bowling (dp)
- POJ 3176 Cow Bowling 动态规划
- POJ 3176 Cow Bowling
- POJ 3176--Cow Bowling
- Cow Bowling(POJ--3176
- poj_3176Cow Bowling问题(已解决)
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling(数字三角形求最值)
- poj 3176 Cow Bowling
- POJ-3176-Cow Bowling
- Cow Bowling(POJ, 3176, 基础dp)
- POJ 3176 Cow Bowling
- [POJ] 3176 Cow Bowling
- POJ 3176, Cow Bowling