Cow Bowling
来源:互联网 发布:淘宝秒杀抢拍器手机版 编辑:程序博客网 时间:2024/06/02 02:12
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.
#include <iostream>#include<string.h>using namespace std;//http://poj.org/problem?id=3176//好像还挺简单的dp,比较左上和上面的哪个大就加哪个 int n,dp[400][400],a[400][400];void f(){ int res=0; for(int i=1;i<=n;i++){ for(int j=1;j<=i;j++){ dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+a[i][j]; } } for(int i=1;i<=n;i++){ res=max(res,dp[n][i]); } cout<<res<<endl;}int main(int argc, char *argv[]) { while(cin>>n){ memset(dp,0,sizeof(dp)); memset(a,0,sizeof(a)); for(int i=1;i<=n;i++){ for(int j=1;j<=i;j++){ cin>>a[i][j]; } } f(); } return 0;}
- Cow Bowling
- Cow Bowling
- Cow Bowling
- Cow Bowling
- Cow Bowling
- Cow Bowling
- POJ 3176 COW BOWLING
- PKU 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 3166 Cow Bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- Java安全学习笔记(七)-攻击消息摘要保存的口令
- 面试总结
- java根据当前时间获取前一个月的日期组成List
- Linux下的基本网络配置
- Android 的约定命名
- Cow Bowling
- Java爬虫系列之三模拟浏览器【模块浏览OSChina网站】
- ACM算法-时间复杂度分析(2.最坏,平均,最好时间复杂度分析)
- 有向加权图的深度优先遍历—C
- Redirect traffic to loopback
- php类实现数据分页操作
- (9)session
- k-means聚类算法的详解和实现
- Spring Boot 入门教程-入门程序