Monkey and Banana
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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
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. 每一个物品可以使用无限次,所以将一个物品分为三个,每个物品只能以x,y为底,z为高放置。
2. 对所有物品排序,保证“底”大的在前,状态转移时先考虑“底”大的物品
3. dp[i]表示第i件物品放在最上面能达到的最大高度值
dp[i]=max(dp[j]+a[i].z,dp[i]);//j属于1 - i,且a[i]能放在a[j]上
AC代码:
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <bitset>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#define maxn 100
#define maxm 1010
#define inf 0x7fffffff
using namespace std;
int dp[maxn]; //第i件物品放在最上面能达到的最大高度值
struct block
{
int x,y,z;
}a[maxn];
int cmp(block a,block b) //对物品排序,状态转移时先考虑“底”大的物品
{
if(a.x==b.x)
{
return a.y>b.y;
}
else
{
return a.x>b.x;
}
}
int main()
{
int n,kase=0;
while(scanf("%d",&n),n)
{
int k=1;
for(int i=0;i<n;i++)
{
int x,y,z;
scanf("%d %d %d",&x,&y,&z);
//将一个物体的三种放置情况等价为三种物品
a[k].x=max(x,y);
a[k].y=min(x,y);
a[k++].z=z;
a[k].x=max(x,z);
a[k].y=min(z,x);
a[k++].z=y;
a[k].x=max(y,z);
a[k].y=min(z,y);
a[k++].z=x;
}
sort(a+1,a+k,cmp);
int ans=0;
for(int i=1;i<k;i++)
{
dp[i]=a[i].z;
for(int j=1;j<i;j++)
{
if(a[j].x>a[i].x&&a[j].y>a[i].y)
{
dp[i]=max(dp[j]+a[i].z,dp[i]);
}
}
ans=max(ans,dp[i]);
}
printf("Case %d: maximum height = %d\n",++kase,ans);
}
return 0;
}