HDU-1069 Monkey and Banana(动态规划)
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 0Sample Output
Case 1: maximum height = 40 Case 2: maximum height = 21 Case 3: maximum height = 28 Case 4: maximum height = 342
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
struct node
{
int l;
int w;
int h;
} a[1200];
bool cmp(node a, node b)
{
if(a.l==b.l)
return a.w>b.w;
return a.l>b.l;
}
int dp[1200];
int main()
{
int n,cas=1,i,j;
while(scanf("%d",&n),n)
{
int xxx[3];
int k=0;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&xxx[0],&xxx[1],&xxx[2]);
sort(xxx,xxx+3);
a[k].l=xxx[0];
a[k].w=xxx[1];
a[k].h=xxx[2];
k++;
a[k].l=xxx[1];
a[k].w=xxx[2];
a[k].h=xxx[0];
k++;
a[k].l=xxx[0];
a[k].w=xxx[2];
a[k].h=xxx[1];
k++;
}
sort(a,a+k,cmp);
int maxn=0;
for(i=0;i<k;i++)
{
dp[i]=a[i].h;//关键的dp赋值 ,dp是到哪一个时最大的高度,当然要包括自己
for(j=0;j<i;j++)//动态规划就在于本层加上之前的每一层比较该层,不漏。。
if(a[j].l>a[i].l&&a[j].w>a[i].w)
dp[i]=max(dp[i],dp[j]+a[i].h);
maxn=max(dp[i],maxn);
}
printf("Case %d: maximum height = %d\n",cas++,maxn);
}
return 0;
}