题目链接:https://vjudge.net/problem/UVA-437
题意:给定N种立方体,每种无限个,可以任意旋转,问最高能立起来多少个,即上一个的长宽均小于下面的长宽。
题解:每种旋转一共有6种情况,然后按排序从最大的往下找即可。
AC代码:
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
#define _for(i,a,b) for(int i=a;i<=b;i++)
const int maxn = 33;
struct node
{
int x,y,z;
bool operator<(const node& a)const
{
if(x==a.x)return y>a.y;
return x>a.x;
}
}a[maxn],b[maxn*6];
int n,dp[maxn*6];
bool check(int i,int j)
{
if(b[i].x>b[j].x&&b[i].y>b[j].y)return true;
return false;
}
void intc()
{
memset(a,sizeof(a),0);
memset(b,sizeof(b),0);
memset(dp,sizeof(dp),0);
}
int main(int argc, char const *argv[])
{
int t = 0;
while(cin>>n)
{
t++;
if(n==0)break;
intc();
_for(i,1,n)
{
cin>>a[i].x>>a[i].y>>a[i].z;
b[i*6-5]=a[i];
b[i*6-4].x=a[i].y;
b[i*6-4].y=a[i].z;
b[i*6-4].z=a[i].x;
b[i*6-3].x=a[i].z;
b[i*6-3].y=a[i].x;
b[i*6-3].z=a[i].y;
b[i*6-2].x=a[i].x;
b[i*6-2].y=a[i].z;
b[i*6-2].z=a[i].y;
b[i*6-1].x=a[i].z;
b[i*6-1].y=a[i].y;
b[i*6-1].z=a[i].x;
b[i*6].x=a[i].y;
b[i*6].y=a[i].x;
b[i*6].z=a[i].z;
}
sort(b+1,b+1+6*n);
int ans = 0;
_for(i,1,n*6)dp[i]=b[i].z;
_for(i,1,n*6)
{
_for(j,1,i-1)
{
if(check(j,i))dp[i]=max(dp[i],dp[j]+b[i].z);
}
}
_for(i,1,n*6)ans=max(ans,dp[i]);
printf("Case %d: maximum height = %d\n",t,ans);
}
return 0;
}