POJ 3176:Cow Bowling
来源:互联网 发布:数据透视分析表怎么用 编辑:程序博客网 时间:2024/06/10 12:27
Cow Bowling
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13464 Accepted: 8897
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.
简单的数塔DP问题。
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;const int M = 350 +5;int Cow[M][M];int main(){ int n; while(scanf("%d", &n)!=EOF) { memset(Cow, 0, sizeof(Cow)); for(int i=1; i<=n; i++) for(int j=1; j<=i; j++) { scanf("%d", &Cow[i][j]); } for(int i=n-1; i>=1; i--) for(int j=1; j<=i; j++) Cow[i][j]+=max(Cow[i+1][j], Cow[i+1][j+1]); cout<<Cow[1][1]<<endl; } 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
- 模态对话框 vs 非模态对话框
- 性能测试之性能计数器和监测工具
- hdu 1075
- C#开发Android-文件的读写
- 写了一个程序,分析各个源文件之间的include关系。
- POJ 3176:Cow Bowling
- Android写通讯录 用到的数据库知识
- hdu 1241 Oil Deposits
- 剑指offer面试题13扩展:带头指针的单链表的操作
- 通过端口 1433 连接到主机 localhost 的 TCP/IP 连接失败。错误:“Connection refused: connect。
- Etherpeek监听UDP报文时间戳获取
- libsvm工具箱C++下编程实践1
- ruby on rails学习(一)
- 三种创建二叉树的方式