POJ Cow Bowling(dp)
来源:互联网 发布:软件可靠性设计 编辑:程序博客网 时间:2024/05/15 23:43
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, NLines 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 rulesSample Input
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5Sample Output
30
Hint
Explanation of the sample:
7 * 3 8 * 8 1 0 *2 7 4 4 *
4 5 2 6 5
The highest score is achievable by traversing the cows as shown above.
分析
dp水题。
/*===============================================================* Copyright (C) 2016 All rights reserved.* * 文件名称:A.cpp* 创 建 者:gsh* 创建日期:2016年08月10日* 描 述:** 更新日志:*================================================================*/#include <cstdio>#include <iostream>typedef long long ll;typedef unsigned long long ull;using namespace std;int main(){ //freopen("A.in","r",stdin); //freopen("A.out","w",stdout); int a[400][400]; int n; while(scanf("%d",&n) != EOF) { for(int i = 0; i < n; i++) for(int j = 0; j <= i; j++) cin >> a[i][j]; for(int i = n-2; i >= 0; i--) for(int j = 0; j <= i; j++) a[i][j] += max(a[i+1][j], a[i+1][j+1]); cout << a[0][0] << endl; } return 0;}
- POJ Cow Bowling(dp)
- poj 3176 -- Cow Bowling (dp)
- POJ 3176 Cow Bowling (dp)
- POJ 3176 Cow Bowling(dp)
- POJ 3176 Cow Bowling(基础DP)
- 【POJ】3176 - Cow Bowling(dp)
- POJ-3176-Cow Bowling-(简单dp)
- Cow Bowling(POJ, 3176, 基础dp)
- POJ 3176 Cow Bowling DP
- poj-3176-Cow Bowling-dp
- poj 3176 Cow Bowling (DP)
- poj 3167 Cow Bowling【dp】
- poj 3176 Cow Bowling dp
- POJ 3176 Cow Bowling DP
- poj 3176Cow Bowling DP
- Poj 3176 Cow Bowling【dp】
- POJ 3176 Cow Bowling (dp)
- POJ 3176 Cow Bowling (数字三角形DP)
- win10如何查看电脑启动时间
- 分布式事务
- iOS每日一记 -----------------------发财鱼写入通讯录
- 用Natapp(ngrok)进行微信本地开发调试
- Nginx(9) nginx + tomcat动静分离
- POJ Cow Bowling(dp)
- 初级UnityDemo全纪录(二):代码篇②
- 3D空间的左手坐标系和右手坐标系的区别
- Git 学习笔记 --- 标签管理
- 1
- 各种排序算法(内部排序)及其实现
- BZOJ4318: OSU!
- 初始化与构造器
- GCC编译总结