HDU-1069 约束DP

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
题意：
给一些长方体(可以翻转),规格(x,y,z),求在下面一个的底面能完全覆盖(不能恰好)上一个的底面条件下，能达到的最大高度。
解题思路：
dp[i]=max(dp[i],dp[j]+height[i]); // i 来组成头部。= v =
代码：

#include<bits/stdc++.h>
using namespace std;
inline int read(){
    	int x=0,f=1;char ch=getchar();
    	while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
    	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    	return x*f;
}
struct xyz{		//set会自动排序,结构体要重载<,长宽大的在下面
	int p[3];
	bool friend operator <(const xyz &a,const xyz &b){
		return a.p[0]==b.p[0]?(a.p[1]==b.p[1]?a.p[2]>b.p[2]:a.p[1]>b.p[1]):a.p[0]>b.p[0];
	}
};
int main(){
	int n,cnt=0;
	while(n=read()){
		++cnt;
		set<xyz>s;
		for(int i=0;i<n;++i){
			xyz a;
			int p[3],x=read(),y=read(),z=read();
			p[0]=min(min(x,y),z),p[2]=max(max(x,y),z),p[1]=x+y+z-p[0]-p[2];
			do
			{
				for(int i=0;i<3;++i)a.p[i]=p[i];
				s.insert(a);
			}while(next_permutation(p,p+3));	//stl下一个排列(字典序)
		}
		int f[200][3]={0},dp[200]={0};
		int k=0;
		for(auto i=s.begin();i!=s.end();++i,++k)
			for(int j=0;j<3;++j) f[k][j]=(*i).p[j];
		dp[0]=f[0][2];
		for(int i=1;i<k;++i){
			dp[i]=f[i][2];
			for(int j=0;j<i;++j)
				if(f[i][0]<f[j][0]&&f[i][1]<f[j][1]) dp[i]=max(dp[i],dp[j]+f[i][2]);
		}
		printf("Case %d: maximum height = %d\n",cnt,*max_element(dp,dp+k));
	}
}