HDU 1069 Monkey and Banana DP
来源:互联网 发布:校宝软件下载 编辑:程序博客网 时间:2024/06/06 00:14
Monkey and Banana
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16430 Accepted Submission(s): 8744
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.
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.
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
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 270
Sample Output
Case 1: maximum height = 40Case 2: maximum height = 21Case 3: maximum height = 28Case 4: maximum height = 342#include<stdio.h>#include<string.h>#include<stdlib.h>#include<algorithm>#include<iostream>using namespace std;struct rec{int x,y,z;};int dp[200];rec R[200];int cmp(rec a,rec b){if(a.x!=b.x)return a.x>b.x;else return a.y>b.y;}int main(){int n;int cas=0;while(scanf("%d",&n) && n){cas++;int a,b,c;int num=0;for(int i=1;i<=n;i++){scanf("%d%d%d",&a,&b,&c);R[++num].x=a,R[num].y=b,R[num].z=c;R[++num].x=a,R[num].y=c,R[num].z=b;R[++num].x=b,R[num].y=a,R[num].z=c;R[++num].x=b,R[num].y=c,R[num].z=a;R[++num].x=c,R[num].y=b,R[num].z=a;R[++num].x=c,R[num].y=a,R[num].z=b;}sort(R+1,R+1+num,cmp);for(int i=1;i<=num;i++)dp[i]=R[i].z;for(int i=1;i<num;i++){for(int j=1;j<=i;j++){if(R[j].x>R[i].x && R[j].y>R[i].y)dp[i]=max(dp[i],dp[j]+R[i].z);}}int maxn=0;for(int i=1;i<=num;i++)maxn=max(maxn,dp[i]);printf("Case %d: maximum height = %d\n",cas,maxn);}}
阅读全文
0 0
- hdu 1069 Monkey and Banana (DP)
- hdu 1069 Monkey and Banana(dp)
- HDU-1069 Monkey and Banana (DP)
- Hdu 1069 Monkey and Banana -- DP
- HDU 1069 Monkey and Banana DP LIS
- HDU 1069 Monkey and Banana(DP)
- hdu 1069 Monkey and Banana(简单dp)
- HDU 1069 Monkey and Banana(dp)
- HDU 1069 Monkey and Banana DP
- Monkey and Banana - HDU 1069 dp
- hdu 1069 Monkey and Banana (dp)
- [HDU 1069]Monkey and Banana(DP)
- 【DP|LIS】HDU-1069 Monkey and Banana
- hdu 1069 Monkey and Banana dp
- HDU 1069 Monkey and Banana (dp)
- hdu 1069 Monkey and Banana(dp)
- HDU 1069Monkey and Banana Dp问题
- hdu 1069 Monkey and Banana(dp)
- udev配置RAC ASM的几种方式
- 数据库索引的设计原理以及意义
- 遍历集合ConcurrentModificationException异常
- 树的基本概念
- android stuido关于在V7包和recyclerview包冲突的解决办法
- HDU 1069 Monkey and Banana DP
- 聚会
- h5的插入历史记录和替换历史记录
- 报表小数点前0不显示的问题解决
- STM32F103RE单片机空间不足解决办法
- svn命令行ubuntu上使用 删除 新增 添加 提交 状态查询 恢复
- ios NSURLSessionDataTask 封装下载 断点续传 不可以后台下载(一)
- 多路径安装Oracle RAC时的共享盘的设置
- POJ 3984 迷宫问题