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种摆放状态,我们可以用3个长方体代替3种状态,求n×3
个长方体可以堆放可以达到的最大高度,接下来就是求面积递减的高度和最大的
子序列,dp【i】是i长方体在最上面的最大高度
状态转移方程 dp【i】=max(dp【1-----i-1】)+h【i】
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAX 150
using namespace std;
struct node{
int l,w,h;
int s;//长,宽,高
}num[MAX];//面积
int dp[MAX];
int cmp(node a,node b){//面积从大到小排序
return a.s>b.s;
}
int main(){
int n;
int ans=0;
while(scanf("%d",&n)!=EOF){
if(n==0) break;
memset(num,0,sizeof(num));
memset(dp,0,sizeof(dp));
int cnt=0;
int i;
for(i=0;i<n;i++){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);//一块物体最多有3种摆放状态
num[++cnt].l=a;num[cnt].w=b;num[cnt].h=c;num[cnt].s=a*b;
num[++cnt].l=c;num[cnt].w=b;num[cnt].h=a;num[cnt].s=c*b;
num[++cnt].l=a;num[cnt].w=c;num[cnt].h=b;num[cnt].s=a*c;
}
sort(num+1,num+cnt+1,cmp);
int j;
for(i=1;i<=cnt;i++){
int maxh=0,besti=0;
for(j=1;j<i;j++){
if(num[j].w>num[i].w&&num[j].l>num[i].l//上面物体的长宽均严格小于下面物体的长宽
||num[j].l>num[i].w&&num[j].w>num[i].l)
if(dp[j]>maxh){
maxh=dp[j];
besti=j;
}
}
dp[i]=dp[besti]+num[i].h;
}
int maxx=0;
for(i=1;i<=cnt;i++)
maxx=max(maxx,dp[i]);
printf("Case %d: maximum height = %d\n",++ans,maxx);
}
return 0;
}