ZOJ_1093_Monkey and Banana
2015-08-01 17:33
441 查看
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld
& %llu
Submit Status Practice ZOJ
1093
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.
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.
这道题的原型是最长上升子序列的问题,但是这道题需要把箱子的摆放形态设置好,一个箱子可以有多种摆放形态
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
struct node
{
int x,y,z;
};
bool cmp(node a,node b)
{
return a.x<b.x||(a.x==b.x&&a.y<b.y);
}
using namespace std;
node b[200];
int d[200];
int main()
{
int n,cnt=0;
while(scanf("%d",&n)!=EOF&&n)
{
memset(b,0,sizeof(b));
memset(d,0,sizeof(d));
int x,y,z;
cnt++;
int k=0;
while(n--)
{
scanf("%d%d%d",&x,&y,&z);
if(x==y)
{
if(y==z)
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
}
else
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
b[k].x=z;b[k].y=y;b[k].z=x;k++;
b[k].x=y;b[k].y=z;b[k].z=x;k++;
}
}
else
{
if(y==z)
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
b[k].x=y;b[k].y=x;b[k].z=z;k++;
b[k].x=y;b[k].y=z;b[k].z=x;k++;
}
else if(x==z)
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
b[k].x=y;b[k].y=x;b[k].z=z;k++;
b[k].x=x;b[k].y=z;b[k].z=y;k++;
}
else
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
b[k].x=y;b[k].y=x;b[k].z=z;k++;
b[k].x=x;b[k].y=z;b[k].z=y;k++;
b[k].x=z;b[k].y=x;b[k].z=y;k++;
b[k].x=y;b[k].y=z;b[k].z=x;k++;
b[k].x=z;b[k].y=y;b[k].z=x;k++;
}
}
}
sort(b,b+k,cmp);
for(int i=0;i<k;i++)
{
d[i]=b[i].z;
}
int max=0;
for(int i=1;i<k;i++)
{
max=0;
for(int j=0;j<i;j++)
{
if(b[j].x<b[i].x&&b[j].y<b[i].y)
{
if(max<d[j])
{
max=d[j];
}
}
}
d[i]=max+b[i].z;
}
max=0;
for(int i=0;i<k;i++)
{
if(d[i]>max) max=d[i];
}
cout<<"Case "<<cnt<<": maximum height = "<<max<<endl;
}
return 0;
}
& %llu
Submit Status Practice ZOJ
1093
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 Specification
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 Specification
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 <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
struct node
{
int x,y,z;
};
bool cmp(node a,node b)
{
return a.x<b.x||(a.x==b.x&&a.y<b.y);
}
using namespace std;
node b[200];
int d[200];
int main()
{
int n,cnt=0;
while(scanf("%d",&n)!=EOF&&n)
{
memset(b,0,sizeof(b));
memset(d,0,sizeof(d));
int x,y,z;
cnt++;
int k=0;
while(n--)
{
scanf("%d%d%d",&x,&y,&z);
if(x==y)
{
if(y==z)
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
}
else
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
b[k].x=z;b[k].y=y;b[k].z=x;k++;
b[k].x=y;b[k].y=z;b[k].z=x;k++;
}
}
else
{
if(y==z)
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
b[k].x=y;b[k].y=x;b[k].z=z;k++;
b[k].x=y;b[k].y=z;b[k].z=x;k++;
}
else if(x==z)
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
b[k].x=y;b[k].y=x;b[k].z=z;k++;
b[k].x=x;b[k].y=z;b[k].z=y;k++;
}
else
{
b[k].x=x;b[k].y=y;b[k].z=z;k++;
b[k].x=y;b[k].y=x;b[k].z=z;k++;
b[k].x=x;b[k].y=z;b[k].z=y;k++;
b[k].x=z;b[k].y=x;b[k].z=y;k++;
b[k].x=y;b[k].y=z;b[k].z=x;k++;
b[k].x=z;b[k].y=y;b[k].z=x;k++;
}
}
}
sort(b,b+k,cmp);
for(int i=0;i<k;i++)
{
d[i]=b[i].z;
}
int max=0;
for(int i=1;i<k;i++)
{
max=0;
for(int j=0;j<i;j++)
{
if(b[j].x<b[i].x&&b[j].y<b[i].y)
{
if(max<d[j])
{
max=d[j];
}
}
}
d[i]=max+b[i].z;
}
max=0;
for(int i=0;i<k;i++)
{
if(d[i]>max) max=d[i];
}
cout<<"Case "<<cnt<<": maximum height = "<<max<<endl;
}
return 0;
}
相关文章推荐
- Java并发编程实例(synchronized)
- B - The Accomodation of Students - hdu 2444(最大匹配)
- android用讯飞实现TTS语音合成 实现中文版
- php学习笔记_5_数组及预定义变量(未完)
- JSON的解析
- HDU杭电2524 矩形A + B
- eclipse中导入第三方jar包方法
- 在ubuntu 下使用在线(apt-get)方式安装opencv
- JAVA 并发编程-读写锁之模拟缓存系统(十一)
- JAVA 并发编程-线程同步工具类(十二)
- linux解决xhost: unable to open display ""
- Shell 学习13 - Shell echo 命令
- ajax传数组问题
- UILabel自适应高度
- Spring中IoC的入门实例
- POJ 1160 四边形不等式优化DP Post Office
- 时间复杂度(暴力,打表)
- 支持向量机:Numerical Optimization
- hdu 1017 A Mathematical Curiosity
- startActivityForResult和setResult详解