Monkey and Banana
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
题目倒是不难!对于动态规划的题,我觉得最重要的就是找出所谓的递归方程吧!
这点最为重要!找到了递归方程,代码实现只是时间问题罢了!
这道题目有一些要点要抓住!
1,下一层的面积要严格大于上一层!我在这里错了几次!所谓严格大于,那就是下一层的长宽都大于下一层的长宽或宽长,等于都不行!
2,这道问题比较像01背包问题!我用的方法是拆分!即将一种block拆成3种!(一种block有三种摆放姿势,且一种block最多放这三种姿势)这样,先按照面积排序!然后再次动归!可以减少时间复杂度!
3,hdp[i]表示如果以第i块block为顶,最多可以达到的高度!
发AC代码吧!
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
struct block{
int area;
int height;
int width;
int length;
};
bool cmp(block &a,block &b)
{
return a.area>b.area;
}
int main()
{
int kinds;
int i,j,l,w,h,s=1;
int max;
int k;
block b[100];
vector<int> hdp(300);
block temp;
while(1)
{
k=0;
cin>>kinds;
if(kinds==0) break;
for(i=0;i<kinds;i++)
{
cin>>l>>w>>h;
temp.width=l;temp.length=w;
temp.area=l*w; temp.height=h;
b[k++]=temp;
temp.width=l;temp.length=h;
temp.area=l*h; temp.height=w;
b[k++]=temp;
temp.width=h;temp.length=w;
temp.area=h*w; temp.height=l;
b[k++]=temp;
}
//会错意了!严格的小,那就是每一条边(长宽)都要比底下的小!还不能等于!
sort(b,b+kinds*3,cmp);//排序,按照面积从大到小排序!
hdp[0]=b[0].height;//如果以最大底面积的砖块为底,则最高的高度为它的高度
//接下来是动态规划了!
//动归方程为 hdp[i]=max{hdp[j]+b[i].height,b[i].height|b[j].area>b[i].area,j=0,1,……i-1};
for(i=1;i<kinds*3;i++)
{
hdp[i]=b[i].height;
for(j=0;j<i;j++)//如果面积大于b[i].area;那么一定不满足题意!
{
if( (b[i].width<b[j].width && b[i].length<b[j].length)||(b[i].width<b[j].length && b[i].length<b[j].width) )
if( hdp[j]+b[i].height>hdp[i])//寻找最大的值
hdp[i]=hdp[j]+b[i].height;
}
}
max=0;
for(i=0;i<kinds*3;i++)
if(hdp[i]>max)
max=hdp[i];
printf("Case %d: maximum height = %d\n",s,max);
s++;
}
return 0;
}
分享到:
相关推荐
杭电oj1000题解题报告
杭电OJ题目分类的叙述,可以方便去学习去做。
杭电OJ 2028代码 the rosolve of the hdu 2028
本资源主要提供了杭电oj题目分类和自测状况两大类 可实现随机选题等功能.
杭电OJ(1000-1099) AC 代码
杭电OJ部分威士忌的代码 杭电OJ部分威士忌的代码杭电OJ部分威士忌的代码
杭电oj 1047习题
杭电oj上的一些疑问,适用于初学者,可以解答一些疑问 都是一些水题
杭州电子科技大学 oj离线版
杭电oj分类
这是HDUOJ上面的140道题目的答案,其中大部分都是简单题,有些太简单的就没有收集进去,代码为C/C++,全都AC了的,其中有些有具体的说明是怎么做的,例如博弈论那些
杭电oj的离线版以及题目分类的文档 更加一目了然 方便选择适合的题目做 适合暂时上不了网的用于练习
课程资源 杭电OJ1000-1099答案 ,仅供参考...
这是杭电OJ上某些题的解题报告,后续还有上传很多!
基于Laravel 5.0的OJ题解网站 , 目前涵盖安科OJ,南阳OJ,杭电OJ ,北大OJ,浙大OJ.zip
杭电离线oj(2010版),方便不能上网的朋友用,比别的版本增加了很多题!
杭电oj1048答案,c++代码,适合初学者,思路简单
杭电ACM2000-2011题已提交的代码!保证正确!