一个数塔问题
来源:互联网 发布:阿里云ai 编辑:程序博客网 时间:2024/06/15 17:49
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.Input Output Sample Input Sample Output Hint
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.
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.
Line 1: The largest sum achievable using the traversal rules
573 88 1 02 7 4 44 5 2 6 5
30
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
动态规划,最基本的数塔问题。
//2.#if 0#include<iostream>#include<cstring>using namespace std;int a[400][400];int t[400][400];int main(){int n;while(cin>>n){memset(a,0,sizeof(a));memset(t,0,sizeof(t));for(int i=1; i<=n; i++){for(int j=1; j<=i; j++){cin>>a[i][j];t[i][j]=a[i][j];}}for(int i=n-1; i>=1; i--){for(int j=1; j<=i; j++){t[i][j]=max(t[i][j]+t[i+1][j],t[i][j]+t[i+1][j+1]);}}cout<<t[1][1]<<endl;}}#endif
阅读全文
0 0
- 一个数塔问题
- 关于完全数一个问题
- 有关回文数的一个问题
- 请教大家一个数电简单问题
- 分解一个数的因数问题
- 一个关于“取数问题”的游戏
- 求一个数的因数个数问题
- 关于打印浮点数的一个问题
- 每隔2个数删除一个数的删数问题
- 数塔问题
- 数塔问题
- hdu2084数塔问题
- 数塔问题...
- NOJ1079 数塔问题
- NOJ1079 数塔问题
- HDOJ2084数塔问题
- Pascal数塔问题
- 数塔问题
- POJ-3049 字母排列组合 (元音辅音要求)
- 关于jstree自定义右键菜单的使用
- 在内部类中生成对外部类的引用
- Mysql命令行常用操作
- bzoj 3721: PA2014 Final Bazarek 单调栈+贪心
- 一个数塔问题
- 程序员职业生涯全攻略,附神级跳槽攻略图
- Vue插件写、用详解(附demo)
- BZOJ 2301: [HAOI2011]Problem b (莫比乌斯反演)
- 51nod 1640 天气晴朗的魔法 克鲁斯卡尔
- JZOJ1229. Hanoi(2017.8B组)
- mysql之触发器trigger
- cocoa touch 框架结构图
- 内存数组流(ByteArrayInputStream、CharArrayReader、StringReader)