Monkey and Banana
来源:互联网 发布:sql在表中添加字段 编辑:程序博客网 时间:2024/06/06 02:38
Monkey and Banana
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.
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.
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
Case 1: maximum height = 40Case 2: maximum height = 21Case 3: maximum height = 28Case 4: maximum height = 342
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct node{ int area; int l,w,h;//长,宽,高} s[101001];//记录每个长方体的3种状态bool cmp(node a,node b){ return a.area>b.area;}int dp[10000];//纪录每种状态的最大高度int main(){ int n,flag=1; while(~scanf("%d",&n)&&n) { int i,j=0;//j记录每种长方体的个数 for(i=0; i<n; i++) { int a,b,c; scanf("%d%d%d",&a,&b,&c); s[j].area=a*b,s[j].l=a,s[j].w=b,s[j++].h=c; s[j].area=a*c,s[j].l=a,s[j].w=c,s[j++].h=b; s[j].area=c*b,s[j].l=b,s[j].w=c,s[j++].h=a; } sort(s,s+j,cmp);//按面积从大到小排 for(i=0; i<j; i++) { dp[i]=s[i].h;//比他本身低的就不用了 for(int p=0; p<=i; p++) //面积比s[i]小的,一定不符合; { if((s[p].l>s[i].l&&s[p].w>s[i].w)||(s[p].l>s[i].w&&s[p].w>s[i].l)) { dp[i]=max(dp[i],dp[p]+s[i].h);//找出最大高度 } } } int maxx=0; for(int m=0; m<=j; m++) if(maxx<dp[m]) maxx=dp[m]; printf("Case %d: maximum height = %d\012",flag,maxx); flag++; } return 0;}
- Monkey and Banana Problem
- HDUOJ1069 Monkey and Banana
- JOJ1126 Monkey and Banana
- Monkey and Banana
- ZOJ_1903 Monkey and Banana
- Monkey and Banana
- Monkey and Banana
- HDU1069--Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069 Monkey and Banana
- Monkey and Banana
- Monkey and Banana
- Monkey and Banana
- - Monkey and Banana
- Monkey and Banana
- 1069 Monkey and Banana
- 【HDU1069】【Monkey and Banana】
- interface和class的区别
- Greenplum学习10--添加节点gpexpand ①(在每台segment加入一个节点)(生成节点配置文件)
- java.sql.Types,数据库字段类型,java数据类型的对应关系
- mybaits中的返回结果resultType的问题
- google map
- Monkey and Banana
- 图像腐蚀算子SE的选取
- 重拾python 四十二
- User mode drivers
- Oracle数据库版本升级应该看的文章
- 用doxygen+graphviz自动化生成代码文档(附详细教程)
- 文章标题
- C#: 自己写的一个类似BackGroundWorker的类
- 紫书 例题 10-2 不爽的裁判 UVa12169 ex_gcd