求最大高度,而且要保证上一个物体的底面边长要小于下一个物体的底面边长
dp的题关键就是找到递推公式,这道题很像求最大上升子序列(如果没有限制条件的话),我是从塔顶向下计算就是求一个递增的面积的子序列,要保证高度最大
详细题解(这位博主写的很棒):
点击打开链接http://blog.csdn.net/lishuhuakai/article/details/8060529
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.
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.
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
Case 1: maximum height = 40 Case 2: maximum height = 21 Case 3: maximum height = 28 Case 4: maximum height = 342
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct block
{
int area;
int L1;
int L2;
int h;
};
bool cmp(struct block a,struct block b)
{
return a.area<b.area;
}
int main()
{
int n,cnt=1;
while(scanf("%d",&n),n)
{
int ans=0,dp[100]={0};
struct block dim[100];
for(int i=0;i<n;i++)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
dim[3*i].L1=x;
dim[3*i].L2=y;
dim[3*i].h=z;
dim[3*i].area=x*y;
dim[3*i+1].L1=x;
dim[3*i+1].L2=z;
dim[3*i+1].h=y;
dim[3*i+1].area=x*z;
dim[3*i+2].L1=y;
dim[3*i+2].L2=z;
dim[3*i+2].h=x;
dim[3*i+2].area=y*z;
}
sort(dim,dim+3*n,cmp);
for(int i=0;i<3*n;i++)
{
dp[i]=dim[i].h;
for(int j=0;j<i;j++)
{
if((dim[i].L1>dim[j].L1&&dim[i].L2>dim[j].L2)||((dim[i].L1>dim[j].L2&&dim[i].L2>dim[j].L1)))
{
dp[i]=max(dp[i],dp[j]+dim[i].h);
}
}
ans=max(ans,dp[i]);
}
printf("Case %d: maximum height = %d\n",cnt++,ans);
}
return 0;
}