HDU1069-Monkey and Banana
来源:互联网 发布:淘宝剑三高洁丝 编辑:程序博客网 时间:2024/05/18 18:17
Monkey and Banana
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16168 Accepted Submission(s): 8597
Problem Description
A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the monkey is clever enough, it shall be able to reach the banana by placing one block on the top another to build a tower and climb up to get its favorite food.
The researchers have n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions (xi, yi, zi). A block could be reoriented so that any two of its three dimensions determined the dimensions of the base and the other dimension was the height.
They want to make sure that the tallest tower possible by stacking blocks can reach the roof. The problem is that, in building a tower, one block could only be placed on top of another block as long as the two base dimensions of the upper block were both strictly smaller than the corresponding base dimensions of the lower block because there has to be some space for the monkey to step on. This meant, for example, that blocks oriented to have equal-sized bases couldn’t be stacked.
Your job is to write a program that determines the height of the tallest tower the monkey can build with a given set of blocks.
Input
The input file will contain one or more test cases. The first line of each test case contains an integer n,
representing the number of different blocks in the following data set. The maximum value for n is 30.
Each of the next n lines contains three integers representing the values xi, yi and zi.
Input is terminated by a value of zero (0) for n.
Output
For each test case, print one line containing the case number (they are numbered sequentially starting from 1) and the height of the tallest possible tower in the format “Case case: maximum height = height”.
Sample Input
1
10 20 30
2
6 8 10
5 5 5
7
1 1 1
2 2 2
3 3 3
4 4 4
5 5 5
6 6 6
7 7 7
5
31 41 59
26 53 58
97 93 23
84 62 64
33 83 27
0
Sample Output
Case 1: maximum height = 40
Case 2: maximum height = 21
Case 3: maximum height = 28
Case 4: maximum height = 342
Source
University of Ulm Local Contest 1996
Recommend
JGShining
题目大意:有一些长方体,小的堆在大的上,问最大高度。
解题思路:一个长方体拆成3个矩形,每个矩形有一个高度,按长第一关键字排序,再按宽第二关键字排序,跟LIS很像(传送门),所以就设
#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<vector>#include<map>#include<set>#include<queue>#include<algorithm>#include<cstring>using namespace std;typedef long long LL;const int INF=0x3f3f3f3f;const int MAXN=105;const int MOD=100003;int dp[MAXN];struct node{ int x,y,z;}rec[MAXN];bool cmp(node u,node v){ if(u.x==v.x) return u.y>v.y; return u.x>v.x;}int main(){ int n; int cas=0; while(scanf("%d", &n)!=EOF) { if(n==0) break; int x,y,z; int cnt=0; for(int i=1;i<=n;i++) { dp[i]=0; scanf("%d%d%d",&x,&y,&z); cnt++; if(x>y) {rec[cnt].x=x;rec[cnt].y=y;rec[cnt].z=z;} else {rec[cnt].x=y;rec[cnt].y=x;rec[cnt].z=z;} cnt++; if(y>z) {rec[cnt].x=y;rec[cnt].y=z;rec[cnt].z=x;} else {rec[cnt].x=z;rec[cnt].y=y;rec[cnt].z=x;} cnt++; if(x>z) {rec[cnt].x=x;rec[cnt].y=z;rec[cnt].z=y;} else {rec[cnt].x=z;rec[cnt].y=x;rec[cnt].z=y;} } sort(rec+1,rec+cnt+1,cmp); // cout<<"----------------"<<endl; // for(int i=1;i<=cnt;i++) // { // cout<<rec[i].x<<" "<<rec[i].y<<" "<<rec[i].z<<endl; // } // cout<<"----------------"<<endl; int ans=-INF; for(int i=1;i<=cnt;i++) { dp[i]=rec[i].z; for(int j=i-1;j>=1;j--) { if(rec[j].x>rec[i].x&&rec[j].y>rec[i].y) dp[i]=max(dp[j]+rec[i].z,dp[i]); } ans=max(ans,dp[i]); } printf("Case %d: maximum height = %d\n",++cas,ans); } return 0;}/*110 20 3026 8 105 5 571 1 12 2 23 3 34 4 45 5 56 6 67 7 7531 41 5926 53 5897 93 2384 62 6433 83 270Case 1: maximum height = 40Case 2: maximum height = 21Case 3: maximum height = 28Case 4: maximum height = 342*/
- HDU1069--Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069 Monkey and Banana
- 【HDU1069】【Monkey and Banana】
- HDU1069 Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069-Monkey and Banana
- Hdu1069 Monkey and Banana
- hdu1069-Monkey and Banana
- Monkey and Banana||HDU1069
- Hdu1069-Monkey and Banana
- HDU1069-Monkey and Banana
- ZOJ1093 HDU1069 Monkey and banana
- hdu1069之Monkey and Banana
- HDU1069(Monkey and Banana)DP
- spring hibernate 整合 注解
- 来电界面以及响铃分析
- 调用Android系统隐藏方法
- Java并发编程示例(二):获取和设置线程信息
- Python3.0中取消raw_input,统一使用input()
- HDU1069-Monkey and Banana
- EU4-34:Proposing s solution to work issue
- Linux—I/O多路转接之poll
- wordpress优化之修改后台登录地址
- 多因子模型之因子(信号)测试平台----因子值的处理(一)
- 网站开发(十)后台栏目的修改操作
- 查找旋转数组的最小数字
- JSP学习笔记
- 面试题9:斐波那契数列