poj3176--Cow Bowling(dp:数塔问题)
2014-10-16 19:44
393 查看
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:
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
Sample Output
Hint
Explanation of the sample:
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 14028 | Accepted: 9302 |
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
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
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; int dp[400][400] ; int main() { int n , i , j , max1 ; while(scanf("%d", &n) !=EOF) { max1 = 0 ; memset(dp,0,sizeof(dp)); for(i = 1 ; i <= n ; i++) for(j = 1 ; j <= i ; j++) scanf("%d", &dp[i][j]); for(i = 1 ; i <= n ; i++) for(j = 1 ; j <= i ; j++) dp[i][j] = max( dp[i-1][j-1],dp[i-1][j] ) + dp[i][j] ; for(i = 1 ; i <= n ; i++) max1 = max(max1,dp [i]); printf("%d\n", max1); } return 0; }
相关文章推荐
- poj3176--Cow Bowling(dp:数塔问题)
- POJ3176_Cow Bowling【数塔DP】
- POJ 3176 Cow Bowling (简单dp——数塔问题)
- poj3176——Cow Bowling(dp)
- POJ3176-Cow Bowling(dp)
- POJ3176-Cow Bowling-简单dp
- [dp]poj3176 Cow Bowling
- POJ3176——Cow Bowling(水DP)
- [DP]poj3176 Cow Bowling
- POJ 3176 Cow Bowling 保龄球 数塔问题 DP
- 初识动归(DP):POJ3176--Cow Bowling
- POJ 3132 Sum of Different Primes 动态规划 DP 0-1背包问题
- 有向树k中值问题模板!!!(树行dp)
- 树上的动态规划;树的最大独立集;刷表DP,子问题彼此独立没有交集; 无根树转化有根树;
- POJ 1837 天平平衡问题 DP
- 简单dp——[Usaco2008 Mar]River Crossing渡河问题
- 最大子矩阵问题;枚举行的组合,然后利用一维最大子段和的DP算法;
- hdu 1574 RP问题 DP
- hdu 1160 DP 最长子序列问题
- 连续子串的最大值(经典的DP问题)