POJ 3176:Cow Bowling
2015-12-19 14:26
239 查看
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:
The highest score is achievable by traversing the cows as shown above.
简单的数塔DP问题。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13464 | Accepted: 8897 |
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
The highest score is achievable by traversing the cows as shown above.
简单的数塔DP问题。
#include<cstdio> #include<cstring> #include<algorithm> #include<iostream> using namespace std; const int M = 350 +5; int Cow[M][M]; int main() { int n; while(scanf("%d", &n)!=EOF) { memset(Cow, 0, sizeof(Cow)); for(int i=1; i<=n; i++) for(int j=1; j<=i; j++) { scanf("%d", &Cow[i][j]); } for(int i=n-1; i>=1; i--) for(int j=1; j<=i; j++) Cow[i][j]+=max(Cow[i+1][j], Cow[i+1][j+1]); cout<<Cow[1][1]<<endl; } return 0; }
相关文章推荐
- html5 canvas 笔记一(基本用法与绘制图形)
- cut 截取
- 线程同步(同步对象、同步访问对象)http://blog.csdn.net/akof1314/article/details/5764200
- 斐波那契堆
- 使用Volley实现session会话保持
- mybatis报错:批量设置别名时
- 新版数据库分页方法(Sql server2012)
- xamarin for android 生成时“java.exe已退出 代码为1”
- Bash中的$符号
- JavaScript 三种不同位置代码的写法
- golang SQLDriverConnect: {IM005} [Microsoft][ODBC 驱动程序管理器] 驱动程序的 SQLAllocHandle on SQL_HANDLE_DBC 失败
- 性能测试监控工具nmon安装及使用方法
- GPT分区结构
- CSS样式覆盖规则
- android中的EventBus
- 【转】ATA Secure Erase
- <LeetCode OJ> 21. Merge Two Sorted Lists
- 数据库_Mysql_mysql中char,varchar与text类型的区别和选用
- 过生日,也要学学哈,这次是SHELL的GETOPTS
- Hbase 分布查询 - 应用后台程序控制分页