poj 3176 Cow Bowling
来源:互联网 发布:淘宝泳装模特 编辑:程序博客网 时间:2024/04/28 04:05
Cow Bowling
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16897 Accepted: 11266
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
相当标准的数字三角,也是dp里的套路了;
#include<iostream>#include<string>#include<cstring>#include<algorithm>#include<cstdio>using namespace std;int num[351][351];int main(){ int N; scanf("%d",&N); memset(num,0,sizeof(num)); for(int i=1;i<=N;++i) { for(int j=1;j<=i;++j) { scanf("%d",&num[i][j]); } } for(int i=2;i<=N;++i) { for(int j=1;j<=i;++j) { num[i][j]+=(max(num[i-1][j-1],num[i-1][j])); } } int ans=0; for(int i=1;i<=N;++i) { ans=max(ans,num[N][i]); } printf("%d\n",ans); return 0;}
0 0
- 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
- 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
- 聊聊Linux动态链接中的PLT和GOT(2)——延迟重定位
- lua基础(一)
- acm之搜索题目4
- STL容器之优先队列
- 147. Insertion Sort List
- poj 3176 Cow Bowling
- 阿里大数据技术
- java(3)------运算符常用大全
- Mysql日志文件
- JSTL标签不起作用,JSTL标签直接输出表达式
- mysql中MAX()函数MIN()函数
- Nor Flash & Nand Flash & OneNand Flash
- 自己在Web前端项目中解决bug的思路
- Setting Up a Fake SMTP Server