POJ3176-Cow Bowling-简单dp
来源:互联网 发布:ecotect中国气象数据 编辑:程序博客网 时间:2024/06/02 10:33
原题链接
Cow Bowling
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 18427 Accepted: 12264
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.
Source
USACO 2005 December Bronze
#include <cstdio>#include <iostream>using namespace std;int n,dp[2][360],a[360];int main(){ cin >> n; for(int cen=1;cen<=n;cen++){ for(int i=0;i<cen;i++) scanf("%d",&a[i]); dp[cen&1][0]=dp[(cen-1)&1][0] + a[0]; for(int i=1;i<cen;i++) dp[cen&1][i] = max(dp[(cen-1)&1][i-1] + a[i],dp[(cen-1)&1][i] + a[i]); } int res=dp[n&1][0]; for(int i=1;i<n;i++) res = max(res,dp[n&1][i]); cout << res << endl;}
- POJ3176-Cow Bowling-简单dp
- poj3176 Cow Bowling DP
- [dp]poj3176 Cow Bowling
- [DP]poj3176 Cow Bowling
- POJ3176-Cow Bowling(dp)
- (POJ3176) Cow Bowling <简单dp>
- poj3176--Cow Bowling(dp:数塔问题)
- poj3176——Cow Bowling(dp)
- POJ3176——Cow Bowling(水DP)
- POJ3176----Cow Bowling
- poj3176 cow bowling
- poj3176 Cow Bowling
- poj3176 Cow Bowling
- poj3176 Cow Bowling
- POJ3176--Cow Bowling
- POJ3176-Cow Bowling
- POJ3176-Cow Bowling
- POJ3176 Cow Bowling
- USACO 5.4&&5.5解题报告
- FFMpeg处理RTMP流的总结
- TabLayout使用
- live555学习笔记12-h264 rtp包的时间戳
- 利用js中prototype的知识写下拉菜单
- POJ3176-Cow Bowling-简单dp
- Java编程题练习2017-02-16
- POJ 3505 Tower Parking 没读懂
- 1018: [SHOI2008]堵塞的交通traffic
- static变量初始化 静态块
- 接口、类与抽象类
- Android Studio Gradle 进阶设置
- 电脑上访问一个网页,整个过程是怎么样的:DNS、HTTP、TCP、OSPF、IP、ARP
- live555学习笔记13-RTPInterface详解