Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8510Accepted Submission(s): 4403
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
110 20 3026 8 105 5 571 1 12 2 23 3 34 4 45 5 56 6 67 7 7531 41 5926 53 5897 93 2384 62 6433 83 270
Sample Output
Case 1: maximum height = 40Case 2: maximum height = 21Case 3: maximum height = 28Case 4: maximum height = 342
Source
Recommend
JGShining|We have carefully selected several similar problems for you:11761058115910241257
将每个长方体分离成6个，排序后类似求最大上升子序列。
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<string>#include<algorithm>#include<cstdlib>#include<set>#include<queue>#include<stack>#include<vector>#include<map>#define N 100#define Mod 10000007#define lson l,mid,idx<<1#define rson mid+1,r,idx<<1|1#define lc idx<<1#define rc idx<<1|1const double EPS = 1e-11;const double PI = acos ( -1.0 );const double E = 2.718281828;typedef long long ll;const int INF = 1000010;using namespace std;int n,len;struct edge {int c,k,h;} e[N*3];int dp[N*3];bool cmp(edge e1,edge e2){if(e1.c==e2.c)return e1.k<e2.k;return e1.c<e2.c;}void add_edge(int x,int y,int z) {e[len].c=x;e[len].k=y;e[len].h=z;len++;}bool OK(int i,int j) {return (e[i].c>e[j].c&&(e[i].k>e[j].k));}int main() {int ca=1;while(cin>>n&&n) {len=0;int x,y,z;for(int i=0; i<n; i++) {scanf("%d%d%d",&x,&y,&z);add_edge(x,y,z);add_edge(x,z,y);add_edge(y,z,x);add_edge(y,x,z);add_edge(z,x,y);add_edge(z,y,x);}sort(e,e+len,cmp);int ans=-10100100;for(int i=0; i<len; i++) {dp[i]=e[i].h;for(int j=0; j<=i; j++)if(OK(i,j)) {dp[i]=max(dp[i],dp[j]+e[i].h);}ans=max(ans,dp[i]);}printf("Case %d: maximum height = %d\n",ca++,ans);}return 0;}
，对于沙漠中的旅行者，最可怕的不是眼前无尽的荒漠，而是心中没有绿洲。
