poj3176Cow Bowling,数字三角形,动态规划
来源:互联网 发布:顶级源码 编辑:程序博客网 时间:2024/06/05 04:33
Cow Bowling
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17303 Accepted: 11552
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.
从底部向上找,由于是二对一,所以从两者中选取最大着,与上部相加
#include<stdio.h>#include<algorithm>#include <iostream>using namespace std;int n,a[1000][1000];int judge(int n){ int i,j; for(i=n-1;i>=1;i--) for(j=1;j<=i;j++) { if(a[i+1][j]>a[i+1][j+1])
a[i][j]+=a[i+1][j]; else a[i][j]+=a[i+1][j+1]; } return a[1][1];}int main(){ int i,j,ans; while(~scanf("%d",&n)) {for(i=1;i<=n;i++) for(j=1;j<=i;j++) scanf("%d",&a[i][j]); ans=judge(n); printf("%d\n",ans); return 0;}}
0 0
- poj3176Cow Bowling,数字三角形,动态规划
- Cow Bowling 数字三角形 初步动态规划
- poj3176cow bowling
- poj3176Cow Bowling
- 动态规划----数字三角形
- 数字三角形 动态规划
- 动态规划:数字三角形
- 动态规划--数字三角形
- 动态规划--数字三角形
- 动态规划-数字三角形
- 数字三角形--动态规划
- 动态规划&数字三角形
- 动态规划 数字三角形
- 动态规划 数字三角形
- 动态规划:数字三角形
- 动态规划 数字三角形
- 动态规划-数字三角形
- 动态规划:数字三角形
- Emgu cv中的SIFT算法实现
- c#图片在PictureBox内任意角度旋转问题(360度)
- android init.rc中启动的service 默认是disable的,后续如何启动此服务
- 加载单页面应用IOS端出现黑屏的问题,解决方案
- mongoVUE中collections为空,即文件树无法展开问题的解决策略
- poj3176Cow Bowling,数字三角形,动态规划
- hdu 4956 Yet another end of the world ( 取模转化)
- 开启nginx状态监控
- WebView进行post请求
- HDU 1789 Doing Homework again 贪心
- 组合逻辑和时序逻辑
- 关于js原型继承
- 静态方法与非静态方法的区别
- maven 私服搭建(nexus)