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 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.
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.
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
首先分析一下,每种板子其实最多就存在3种,含有相同长度边的板子不可能存在的。所以最多的板子数就是30*3=90个。
嗯,dp[i]表示以i为顶的能够获得的最大高度。那么状态转移方程不难想就是往前寻找能放置的dp[j]那,也就是
1.初始dp[i] = 当前板子的高度。
2.dp[i] =max(dp[i],dp[j] + 当前板子的高度). 这里 如果下标从1开始就是 1<=j < i;
最后扫一遍dp[i]更新最大值就可以了。dp太弱了,一开始都不知道扫一遍,还直接输出了dp[cnt],cnt就是最大板子数,太弱了。。。
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+7;
int n,m;
int l[40][3];
int dp[100];//dp[i]表示以i为顶的最大高度
struct node
{
int l1,l2,key;
bool operator <(const node &a)const
{
if(l1 != a.l1)return l1 > a.l1;
else return l2 > a.l2;
}
} p[100];
int main()
{
int ca = 0;
while(~scanf("%d",&n) && n)
{
int cnt = 0;
for(int i = 0 ; i < n ; ++i)
{
for(int j = 0 ; j < 3 ; ++j)scanf("%d",&l[i][j]);
sort(l[i],l[i]+3);
p[++cnt].l1 = l[i][0];
p[cnt].l2 = l[i][1];
p[cnt].key=l[i][2];
p[++cnt].l1 = l[i][0];
p[cnt].l2 = l[i][2];
p[cnt].key=l[i][1];
p[++cnt].l1 = l[i][1];
p[cnt].l2 = l[i][2];
p[cnt].key=l[i][0];
}
sort(p+1,p+1+cnt);
for(int i = 1 ; i <= cnt ; ++i)
{
dp[i] = p[i].key;
for(int j = 1 ; j < i ; ++j)
{
if(p[j].l1 > p[i].l1 && p[j].l2 > p[i].l2)
{
dp[i] = max(dp[i],dp[j] + p[i].key);
}
}
}
int ans = 0;
for(int i = 1 ; i <= cnt ; ++i)ans =max(ans,dp[i]);
printf("Case %d: maximum height = %d\n",++ca,ans);
}
return 0;
}