POJ 3176 Cow Bowling(简单DP)
来源:互联网 发布:栈的算法思想 编辑:程序博客网 时间:2024/05/29 16:57
Cow Bowling
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 15952
Accepted: 10626
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:
Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable.
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.
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
573 88 1 02 7 4 44 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.
题意:和HDOJ的数塔一模一样啦,从顶层部开始走,每一层取一个数,且必须以向正下方或者斜下方走,问走到底层,数字相加的和最大是多少。
代码如下:
#include<cstdio>#include<cstring>int map[360][360];int main(){int n,i,j;while(scanf("%d",&n)!=EOF){for(i=0;i<n;++i){for(j=0;j<=i;++j)scanf("%d",&map[i][j]);}for(i=n-2;i>=0;--i){for(j=0;j<=i;++j)map[i][j]+=map[i+1][j]>map[i+1][j+1]?map[i+1][j]:map[i+1][j+1];}printf("%d\n",map[0][0]);}return 0;}
0 0
- POJ 3176 Cow Bowling (简单DP)
- POJ 3176 Cow Bowling (简单DP)
- POJ 3176-Cow Bowling (简单DP)
- POJ 3176 Cow Bowling (简单DP)
- POJ 3176 Cow Bowling(简单DP)
- POJ-3176-Cow Bowling-(简单dp)
- POJ 3176 Cow Bowling DP
- poj-3176-Cow Bowling-dp
- poj 3176 Cow Bowling (DP)
- poj 3176 Cow Bowling dp
- POJ 3176 Cow Bowling DP
- poj 3176Cow Bowling DP
- Poj 3176 Cow Bowling【dp】
- POJ 3176 Cow Bowling (dp)
- POJ-3176 Cow Bowling 数塔,简单DP
- poj 3176 Cow Bowling(最简单DP题)
- poj 3176 -- Cow Bowling (dp)
- poj 3176 Cow Bowling 数塔dp
- SSH登陆远程主机后进入指定目录或执行命令
- 短信加密机制的设计模式
- hive编程指南--hive基础知识
- 成人高考专升本《生态学基础》章节复习题
- 机器视觉学习笔记(5)——基于OpenCV的单目摄像机标定
- POJ 3176 Cow Bowling(简单DP)
- shell的foreach 函数
- jdbc of sqlite getClob()-- java.sql.SQLException: not implemented by SQLite JDBC driver
- spring,IOC和AOP
- 关于mysql异常: Access denied for user 'root'@'localhost' (using password: YES)的解决方法
- useful kaldi posts
- Dynamics CRM2015 Update1 新功能之表单增强功能
- 渗透测试工具sqlmap基础教程
- Android IntentService