poj 3176 Cow Bowling动态规划
来源:互联网 发布:淘宝旗舰店买到假货 编辑:程序博客网 时间:2024/05/19 08:37
Cow Bowling
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12462 Accepted: 8219
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 5Then 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:
这道题意思很简单就是给你一个三角形的矩阵[i][j]只能走向自己的下面[i+1][j]和右下面[i+1][j+1]并且权值相加
求走完所有的行最大的权值,这道题同样可以通过我的吃豆机器人解释吃豆机器人链接
很好的解释了状态方程的由来
7 * 3 8 * 8 1 0 * 2 7 4 4 * 4 5 2 6 5The highest score is achievable by traversing the cows as shown above.
这道题意思很简单就是给你一个三角形的矩阵[i][j]只能走向自己的下面[i+1][j]和右下面[i+1][j+1]并且权值相加
求走完所有的行最大的权值,这道题同样可以通过我的吃豆机器人解释吃豆机器人链接
很好的解释了状态方程的由来
#include<stdio.h>#include<iostream>#include<cstring>using namespace std;int dp[355][355];int max(int a,int b){return a>b?a:b;}int main(){int i,j,n,num;while(scanf("%d",&n)!=EOF){memset(dp,0,sizeof(dp));num=0;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]);if(dp[i][j]>num)num=dp[i][j];}printf("%d\n",num);}return 0;}另一道题poj1163也是这个思路,代码不用改都能通过点击打开链接
- poj 3176 Cow Bowling动态规划
- POJ 3176 Cow Bowling 动态规划
- POJ 3176 Cow Bowling 【动态规划】【水题】
- POJ 3176 Cow Bowling 动态规划
- POJ 3176 Cow Bowling(动态规划DP 经典)
- Cow Bowling(动态规划)
- POJ 1163 The Triangle & POJ 3176 Cow Bowling(DP动态规划)
- 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 3176 Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- python datetime、time、date
- Jquery Mobile组件的刷新
- 实例解析shell子进程(subshell )
- 【转】android中onMeasure初看,深入理解布局之一!
- 教你如何写好一个网站的标题!
- poj 3176 Cow Bowling动态规划
- OpenLDAP基金主席Kurt D. Zeilenga谈OpenLDAP 并发连接数的上限问题
- 十条建议送给那些初入职场的小白
- VIM2:在VIM中添加一键编译和一键运行
- 很久以前写的一个java模拟扑克牌洗牌发牌的小程序,学的知识少写的比较麻烦,不过也放上来吧
- cuda 关于线性并行
- 如何解决古筝弹奏过程中码子的滑动问题及克服杂音
- Gps driver for Tiny4412+Android4.2.2(by liukun321咕唧咕唧)
- 那些年和百度推广一起度过的日子