每日打卡(1/1)
传送门:点击打开链接
题目大意:
就是叠长方体,每种有无数多个,但是一个只能叠在另一个长和宽都比它大的长方体上面。
思路:
假设一个长方体长宽高都不同,那么它就可以以6个不同的姿势摆放,所以添加到vector的时候需要添加6个,然后就用动态规划即可。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
struct node{
int x,y,z;
bool operator<(const node&a) const{
if(a.x==x)
return y<a.y;
return x<a.x;
}
};
int n,dp[1000003];
vector<node> E;
int main()
{
// freopen("d://test.txt","r",stdin);
int n,ans=1;
while(~scanf("%d",&n)&&n)
{
E.clear();
for(int i=0;i<n;i++)
{
int x,y,z;
node a;
scanf("%d%d%d",&x,&y,&z);
if(x==y)
{
if(y==z) {
a.x = x;
a.y = y;
a.z = z;
E.push_back(a);
}
else {
a.x = x;
a.y = y;
a.z = z;
E.push_back(a);
a.x = z;
a.y = y;
a.z = x;
E.push_back(a);
a.x = y;
a.y = z;
a.z = x;
E.push_back(a);
}
}
else {
if(y==z) {
a.x = x;
a.y = y;
a.z = z;
E.push_back(a);
a.x = y;
a.y = x;
a.z = z;
E.push_back(a);
a.x = y;
a.y = z;
a.z = x;
E.push_back(a);
}
else if(x==z){
a.x = x;
a.y = y;
a.z = z;
E.push_back(a);
a.x = x;
a.y = z;
a.z = y;
E.push_back(a);
a.x = y;
a.y = x;
a.z = z;
E.push_back(a);
}
else {
a.x = x;
a.y = y;
a.z = z;
E.push_back(a);
a.x = x;
a.y = z;
a.z = y;
E.push_back(a);
a.x = y;
a.y = x;
a.z = z;
E.push_back(a);
a.x = y;
a.y = z;
a.z = x;
E.push_back(a);
a.x = z;
a.y = x;
a.z = y;
E.push_back(a);
a.x = z;
a.y = y;
a.z = x;
E.push_back(a);
}
}
}
sort(E.begin(),E.end());
int len = E.size();
int maxn = -1;
memset(dp,0,sizeof(dp));
for(int i=0;i<len;i++)
dp[i] = E[i].z;
// for(int i=0;i<len;i++)
// cout<<E[i].x<<" "<<E[i].y<<" "<<E[i].z<<" "<<dp[i]<<endl;
for(int i=1;i<len;i++)
{
for(int j=0;j<i;j++)
{
if(E[i].x>E[j].x&&E[i].y>E[j].y)
{
dp[i] = max(dp[i],dp[j]+E[i].z);
}
}
if(dp[i]>maxn)
maxn = dp[i];
}
printf("Case %d: maximum height = %d\n",ans++,maxn);
}
return 0;
}