ZOJ Problem Set - 1093 Monkey and Banana

最新推荐文章于 2023-05-31 13:24:58 发布

湖心北斗2013

最新推荐文章于 2023-05-31 13:24:58 发布

阅读量1.2k

点赞数

分类专栏：贪心算法

本文链接：https://blog.youkuaiyun.com/Jackwuyongxing/article/details/9296165

版权

贪心算法专栏收录该内容

1 篇文章

订阅专栏

探讨一个经典的编程问题——猴子与香蕉。研究者通过提供不同尺寸的积木让猴子堆叠以拿到香蕉，以此测试猴子的智商。该问题转化为寻找最高可能塔的高度，需要使用贪心算法并考虑积木的不同排列方式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

ZOJ Problem Set - 1093

Monkey and Banana

Time Limit: 2 Seconds Memory Limit:65536 KB

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 (x_i, y_i, z_i). 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 x_i, y_i and z_i.
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

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<algorithm>
using namespace std;
struct Box{
	int len,wid,hei;
};
Box box[600];
bool cmp(Box a,Box b)
{
	if(a.len!=b.len)
	{
		return a.len>b.len;
	}
	else return a.wid>b.wid;
}
void oriente(int index,int x,int y,int z)
{
	box[index].len=x;
	box[index].wid=y;
	box[index].hei=z;
}
int main()
{
	int n;
	int cas=0;
	while(cin>>n&&n!=0)
	{
		int number=0;
		for(int i=0;i<n;i++)
		{
			int t1,t2,t3;
			cin>>t1>>t2>>t3;
			oriente(number++,t1,t2,t3);
			oriente(number++,t1,t3,t2);
			oriente(number++,t2,t1,t3);
			oriente(number++,t2,t3,t1);
			oriente(number++,t3,t1,t2);
			oriente(number++,t3,t2,t1);
		}
		sort(box,box+number,cmp);
		int height[600];
		for(int i=0;i<number;i++)
		   height[i]=box[i].hei;
		int result=0;
		for(int i=1;i<number;i++)
		{
		    int max=0;
			for(int j=i-1;j>=0;j--)
			{
				if(box[j].len>box[i].len&&box[j].wid>box[i].wid&&max<height[j])
				{
				  max=height[j];
				}
			}
			height[i]+=max;
			if(result<height[i])
			   result=height[i];
		}
		cout<<"Case "<<++cas<<": maximum height = "<<result<<endl;
	}
}