HDU 1069 Monkey and Banana

Monkey and Banana

---

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

题目大意：
把给定一些种类的长方体（不限）叠加在一起，叠加的条件是，上面一个长方体的长和宽都比下面长方体的长

解题思路：
一个种类的长方体有三种摆法，将三种摆法都存下来，相当于一共有3*n种长方体。存储完毕后按照长方体的底面由大到小排序。然后动态规划，类似于找最长子序列的思路。每块长方体做顶的时候只有两种可能，一是自己做顶，而是与前面i-1种情况结合。

#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>

using namespace std;
int dp[100005];
int a[3];
struct p
{
    int x;
    int y;
    int z;
};
bool cmp(p p1,p p2)
{
    if(p1.x==p2.x)
    {
        return p1.y>p2.y;
    }
    return p1.x > p2.x;
}
int main()
{
    int n;
    int cnt = 1;
    while(cin>>n&&n!=0)
    {
        vector<p>points;
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++)
        {

            cin>>a[0]>>a[1]>>a[2];

            sort(a,a+3);
            p p1,p2,p3;
            p1.x = a[1];p1.y = a[2];p1.z = a[0];
            p2.x = a[0];p2.y = a[2];p2.z = a[1];
            p3.x = a[0];p3.y = a[1];p3.z = a[2];
            points.push_back(p1);
            points.push_back(p2);
            points.push_back(p3);
        }
        sort(points.begin(),points.end(),cmp);

        int maxs = 0;
        for(int i = 0;i < points.size();i++) 
        {
            dp[i] = points[i].z;//先初始化自己为顶
           for(int j = 0;j < i; j++)
           {
               if((points[j].x > points[i].x&&points[j].y>points[i].y))

                  {
                      dp[i] = max(dp[i],dp[j]+points[i].z); //与之前得到的每一个顶组合比较，找到最大的自己为顶的情况
                  }

           }
           if(maxs<dp[i])
            {
                maxs = dp[i];
            }
        }
        cout<<"Case "<<cnt<<": maximum height = "<<maxs <<endl;
        cnt++;
    }
    return 0;
}