POJ 3176 DP(简单数塔)
来源:互联网 发布:pp盘古越狱 mac版 编辑:程序博客网 时间:2024/06/06 12:48
Cow Bowling
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 15863 Accepted: 10567
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:
7 3 8 8 1 02 7 4 4
4 5 2 6 5
Then 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.
Output
Line 1: The largest sum achievable using the traversal rules
Sample Input
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30
题意:
数塔从上到下,每下一层只能选和上一个位置左右相邻的位置,问怎么走时经过的路径权重相加最大。
解法:
比较经典的dp了,之前在hdu做了一次。这次做做要是求速度,应该是几分钟就敲完AC了。
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#define F(i,a,b) for(int i = a;i<=b;i++)#define FI(i,a,b) for(int i = a;i>=b;i--)int dp[1000];int G[1000][1000];using namespace std;int main(){// freopen("data.in","r",stdin); int n; while(scanf("%d",&n)!=EOF){ F(i,1,n) F(j,1,i) scanf("%d",&G[i][j]); F(i,1,n) dp[i] = G[n][i]; FI(i,n-1,1) F(j,1,i) dp[j] = G[i][j] + max(dp[j],dp[j+1]); printf("%d\n",dp[1]); } return 0;}
- POJ 3176 DP(简单数塔)
- hdu(poj)-2084(3176)-数塔-简单dp
- POJ 3176-Cow Bowling/POJ 1163-The Triangle(简单DP-数塔)
- POJ-3176 Cow Bowling 数塔,简单DP
- POJ 3176 Cow Bowling (简单dp——数塔问题)
- 数塔(简单DP)
- POJ 3176 (简单dp)
- poj 3176 Cow Bowling 数塔dp
- 数塔 (简单dp
- POJ 1157(DP ,数塔问题)
- POJ 3176 简单DP
- POJ 3176 简单DP
- HDU -- 2084 数塔(简单DP)
- hdu2084 数塔(简单DP)
- 【HDU】-2084-数塔(简单DP)
- (简单DP)HDU 2084 数塔
- 简单dp,hdoj2084(数塔)
- POJ-3176-Cow Bowling-(简单dp)
- [Android Studio AS添加第三方库的6种方式(Jar,module,so等)
- play anorm 与Mysql 字段映射
- 文章标题
- Myeclipse 常用快捷键(持续更新)
- 正则表达式中的元字符
- POJ 3176 DP(简单数塔)
- 兼职面试前准备-JavaScript(1)
- Service和Activity之间的通信
- 使用css+js制作水平菜单
- Android Studio AS构建系统-Gradle
- 每天10点来一条通知(待考证)
- Arduino与PC串口通信程序中出现的问题
- linux内存管理理解之释放linux内存
- Android Studio 断点调试和高级调试