数塔问题 动态规划
来源:互联网 发布:中维软件下载 编辑:程序博客网 时间:2024/06/07 14:34
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.
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.
简单数塔,动态规划,不多说。
代码如下:
#include<iostream>#include<cstring>using namespace std;int main(){ int n; int p[500][500]; while(cin>>n) { memset(p,0,sizeof(p)); for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) cin>>p[i][j]; for(int i=n-1;i>0;i--) { for(int j=1;j<=i;j++) { if(p[i+1][j]>p[i+1][j+1]) p[i][j]+=p[i+1][j]; else p[i][j]+=p[i+1][j+1]; } } cout<<p[1][1]<<endl; } return 0;}
阅读全文
0 0
- 动态规划----数塔问题
- 数塔问题----动态规划
- 动态规划~数塔问题
- 动态规划:数塔问题
- [动态规划]数塔问题
- 动态规划 数塔问题
- 动态规划 数塔问题
- 数塔问题 动态规划
- 动态规划 数塔问题
- 关于动态规划 “数塔”问题~
- 动态规划解决数塔问题
- 动态规划初步-数塔问题
- 动态规划——数塔问题
- 动态规划3_数塔问题
- 算法之动态规划-->>数塔问题
- 动态规划算法之数塔问题
- 动态规划——数塔问题
- 动态规划——数塔问题
- c++入门教程(七)
- HDU
- 2017年8月10日训练日记
- 高级控件汇总
- 设计模式(11)组合模式--结构型
- 数塔问题 动态规划
- HDU 2899 Strange fuction(三分)
- 解决:MavenBuild,即Maven生成Jar包时报错问题
- 系统性,全面性软件体系提升----基础技能上的组织能力及方案解决的能力
- gcc编译与调试
- Pie
- Java多线程——龟兔赛跑(加强版)
- 接口自动化之httpclient发get请求、post请求
- eclipse中get(),set()的自动生成