Cow Bowling(动态规划)
来源:互联网 发布:淘宝茵曼旗舰店 编辑:程序博客网 时间:2024/06/06 01:31
Cow Bowling
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19855 Accepted: 13164
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:
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.
Source
USACO 2005 December Bronze
题意:
求一条路径,使从头到尾和最大。
思路:
简单动态规划。
代码:
#include <iostream>#include <cstring>#include <string>using namespace std;int num[550][550],f[550][550];int sum;int main(){ int i,j; int n; cin>>n; for(i=1;i<=n;i++) { for(j=1;j<=i;j++) cin>>num[i][j]; } for(j=1;j<=n;j++)f[n][j]=num[n][j]; for(i=n-1;i>=1;i--) { for(j=1;j<=i;j++) f[i][j]=num[i][j]+max(f[i+1][j],f[i+1][j+1]); } cout<<f[1][1]<<endl;}
阅读全文
1 0
- Cow Bowling(动态规划)
- POJ 3176 Cow Bowling(动态规划DP 经典)
- poj 3176 Cow Bowling动态规划
- POJ 3176 Cow Bowling 动态规划
- Cow Bowling 数字三角形 初步动态规划
- POJ 3176 Cow Bowling 【动态规划】【水题】
- POJ 3176 Cow Bowling 动态规划
- Cow Bowling -- 动态规划的简单递归
- POJ 3176(Cow Bowling )(就是简单的数塔,动态规划)
- POJ 1163 The Triangle & POJ 3176 Cow Bowling(DP动态规划)
- Cow Bowling(POJ 3176)
- POJ Cow Bowling(dp)
- Cow Bowling
- Cow Bowling
- Cow Bowling
- Cow Bowling
- Cow Bowling
- Cow Bowling
- 移动端app创建
- ORACLE EBS:Can't connect to X11 window server using '**' as the value of the DISPLAY variable.
- CPU,内存,硬盘关系图----计算机RUN
- Java基础知识和常用数据结构整理与分析
- hdu6098 Inversion 2017多校第六场1003 埃氏筛法
- Cow Bowling(动态规划)
- 布局显示不全问题
- 【转】AXIS2 和 CXF环境变量的配置
- 开发外汇CRM源码 HPH
- Linux操作系统的简单使用
- C# winform 弹出输入框输入信息
- SpringSecurity【资源和权限加入到数据库】
- 演讲大厅安排题解
- LaTeX入门教程资源,亲测有效