杭电1069-Monkey and Banana
来源:互联网 发布:外卖人8.7 源码 网盘 编辑:程序博客网 时间:2024/05/16 15:46
Monkey and Banana
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5841 Accepted Submission(s): 2966
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一道动态规划题,这里我是按面积排序AC代码+解释:#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cstdlib>#include<cmath>#include<queue>#include<iomanip>#include<map>#include<stack>const int MAX=100;int DP[MAX];using namespace std;typedef struct Rectangle{ int l;//length int w;//width int h;//height int area;};Rectangle s[MAX];int maxn(int x,int y){ return x>y?x:y;}void sort(int n)//按面积从大到小排序{ int i,j,k,Max; Rectangle temp; for(i=0;i<3*n-1;i++) { for(j=i+1;j<3*n;j++) { if(s[i].area<s[j].area) { temp=s[i]; s[i]=s[j]; s[j]=temp; } } }}int main(){ int n,i,j,Max,p=1; int l,w,h; while(cin>>n,n) { j=0; for(i=0;i<n;i++) { cin>>l>>w>>h; s[j].l=l; s[j].w=w; s[j].h=h; s[j++].area=l*w; s[j].l=h; s[j].w=w; s[j].h=l; s[j++].area=w*h; s[j].l=h; s[j].w=l; s[j].h=w; s[j++].area=h*l; } sort(n); DP[0]=s[0].h; Max=0; for(i=1;i<3*n;i++) { DP[i]=s[i].h; for(j=0;j<i;j++) { if((s[i].l<s[j].w&&s[i].w<s[j].l)||(s[i].l<s[j].l&&s[i].w<s[j].w))//当上面的底面小于下面的底面 { DP[i]=maxn(DP[i],DP[j]+s[i].h);//找最大的高度 } } } Max=-1; for(i=0;i<3*n;i++) { if(Max<DP[i]) Max=DP[i]; } cout<<"Case "<<p++<<": maximum height = "<<Max<<endl; } return 0;}
- 杭电1069-Monkey and Banana
- 杭电 1069 Monkey and Banana
- 杭电1069 Monkey and Banana
- 杭电1069Monkey and Banana
- 杭电ACM 1069Monkey and Banana
- 杭电1069 Monkey and Banana
- 杭电1069--Monkey and Banana 子序列,dp
- 1069 Monkey and Banana
- 杭电ACM1069——Monkey and Banana~~动态规划
- 杭电OJ——1069 Monkey and Banana(动态规划!)
- HDU 1069 Monkey and Banana
- hdu 1069 Monkey and banana
- HDOJ 1069 Monkey and Banana
- hdu 1069 Monkey and Banana
- HDU 1069 Monkey and Banana
- hdu 1069 Monkey and Banana
- hdu 1069 Monkey and Banana
- HDU 1069 Monkey and Banana
- assert用法
- How to Hack a WordPress Site using SQL Injection
- Use Innotop Monitoring MySQL
- table选中的行以指定颜色高亮显示
- Android官方提供的支持不同屏幕大小的全部方法
- 杭电1069-Monkey and Banana
- Direct3D 11的初始化
- ZOJ3435 Ideal Puzzle Bobble
- 解决Keyboard遮盖输入的几种办法
- UVA 140 Bandwidth
- 管理定律
- velocity .vm Java模板引擎
- IT旅途——程序员面试经验分享
- Java设计模式透析之 —— 适配器(Adapter)