hdu 1069 Monkey and Banana
2016-07-28 19:42
423 查看
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
给过的矩形能无限用。上面的长和宽都不能比下面的大。问最多能摞多高。
把个个矩形的上宽高都罗列出来,排个序。(长为什么是长,就是因为比宽长!!!!!错哭我了)
然后 从长宽小的往大的递推。
#include<stdio.h>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
int l,w,h;
}s[99];
int cmp(node a,node b){
if(a.l==b.l) return a.w>b.w;
else return a.l>b.l;
}
int main(){
int dp[99];
int n,a[3],t,c=1;
while(~scanf("%d",&n)&&n){
t=0;
for(int i=0;i<n;i++){
scanf("%d%d%d",&a[0],&a[1],&a[2]);
sort(a,a+3);
s[t].l=a[1];s[t].w=a[0];s[t++].h=a[2];
s[t].l=a[2];s[t].w=a[1];s[t++].h=a[0];
s[t].l=a[2];s[t].w=a[0];s[t++].h=a[1];
}
sort(s,s+t,cmp);
for(int i=0;i<t;i++) dp[i]=s[i].h;
for(int i=t-2;i>=0;i--){
for(int j=i+1;j<t;j++){
if(s[i].l>s[j].l&&s[i].w>s[j].w)
if(dp[i]<dp[j]+s[i].h)
dp[i]=dp[j]+s[i].h;//printf("%d~",dp[i]);if(j==0)printf("\n");
}
}
int maxh=-9999999;
for(int i=0;i<t;i++)
if(maxh<dp[i]) maxh=dp[i];
printf("Case %d: maximum height = %d\n",c++,maxh);
}
return 0;
}
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
给过的矩形能无限用。上面的长和宽都不能比下面的大。问最多能摞多高。
把个个矩形的上宽高都罗列出来,排个序。(长为什么是长,就是因为比宽长!!!!!错哭我了)
然后 从长宽小的往大的递推。
#include<stdio.h>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
int l,w,h;
}s[99];
int cmp(node a,node b){
if(a.l==b.l) return a.w>b.w;
else return a.l>b.l;
}
int main(){
int dp[99];
int n,a[3],t,c=1;
while(~scanf("%d",&n)&&n){
t=0;
for(int i=0;i<n;i++){
scanf("%d%d%d",&a[0],&a[1],&a[2]);
sort(a,a+3);
s[t].l=a[1];s[t].w=a[0];s[t++].h=a[2];
s[t].l=a[2];s[t].w=a[1];s[t++].h=a[0];
s[t].l=a[2];s[t].w=a[0];s[t++].h=a[1];
}
sort(s,s+t,cmp);
for(int i=0;i<t;i++) dp[i]=s[i].h;
for(int i=t-2;i>=0;i--){
for(int j=i+1;j<t;j++){
if(s[i].l>s[j].l&&s[i].w>s[j].w)
if(dp[i]<dp[j]+s[i].h)
dp[i]=dp[j]+s[i].h;//printf("%d~",dp[i]);if(j==0)printf("\n");
}
}
int maxh=-9999999;
for(int i=0;i<t;i++)
if(maxh<dp[i]) maxh=dp[i];
printf("Case %d: maximum height = %d\n",c++,maxh);
}
return 0;
}
相关文章推荐
- 面试题59:对称的二叉树
- BRDF模糊环境光照的简单实现
- rabbitmq的监控
- solidworks2014可否保存成以前版本?--问题解决
- 2016 Multi-University Training Contest 4 - 1011 Where Amazing Happens(水水水)
- 使用paramiko模块远程执行命令、上传文件和下载文件
- 一个界面超炫功能超强的圆形进度条
- Y2K Accounting Bug
- listview的多条目样式适配
- 栈的基本操作
- java-jar的格式
- java IO流总结篇(一)
- Java 读写Properties配置文件
- 【转载】http协议介绍
- 机器学习面试问题3
- 如何使用solidworks对产品打螺孔--问题解决
- POJ 3172 Scales(dfs搜索)
- jsf架构
- 手动从零使用ELK构建一套搜索服务
- 哈希函数的构造方法