NYOJ 232 How to eat more Banana

How to eat more Banana

时间限制： 1000 ms  |  内存限制：65535 KB

难度： 4

 

描述

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 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.

输出

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".

样例输入

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

来源

Trinity

上传者

张洁烽

解题：每一种类型最多可以有三种放置方法。排序后求最长上升子序列就可以了。

 1 #include <iostream>

 2 #include <cstdio>

 3 #include <cstring>

 4 #include <cstdlib>

 5 #include <vector>

 6 #include <climits>

 7 #include <algorithm>

 8 #include <cmath>

 9 #define LL long long

10 using namespace std;

11 struct tower {

12     int l,w,h;

13 } p[100];

14 bool cmp(const tower &x,const tower &y){

15     return (x.l < y.l || x.l == y.l&& x.w < y.w);

16 }

17 int main() {

18     int cnt,n,i,j,x,y,z,ans;

19     int dp[100],k = 1;

20     while(scanf("%d",&n),n) {

21         cnt = 0;

22         for(i = 0; i < n; i++) {

23             scanf("%d%d%d",&x,&y,&z);

24             p[cnt].l = max(x,y);

25             p[cnt].w = min(x,y);

26             p[cnt++].h = z;

27             p[cnt].l = max(x,z);

28             p[cnt].w = min(x,z);

29             p[cnt++].h = y;

30             p[cnt].l = max(y,z);

31             p[cnt].w = min(y,z);

32             p[cnt++].h = x;

33         }

34         sort(p,p+cnt,cmp);

35         for(i = 0; i < cnt; i++)

36             dp[i] = p[i].h;

37         ans = INT_MIN;

38         for(i = 0; i < cnt; i++){

39             for(j = i-1; j >= 0; j--){

40                 if(p[j].l < p[i].l && p[j].w < p[i].w && dp[i] < dp[j]+p[i].h)

41                     dp[i] = dp[j]+p[i].h;

42             }

43             if(dp[i] > ans) ans = dp[i];

44         }

45         printf("Case %d: maximum height = %d\n",k++,ans);

46     }

47     return 0;

48 }

View Code