UVA437 The Tower of Babylon

DAG(有向无环图)上的DP.每个砖块的三种放置方式可以当做3个点.dp[i]表示以i为最上面一块转的最高高度.那么dp[i]=max(dp[i],dp[j]+h[i]).其中<j,i>∈E.

对砖块按长宽排序,两层循环套一下.答案就是max(dp[i]),∈V.

贴上代码:

#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>

using namespace std;

struct Block
{
	int l,w,h;
	Block(int m_l=0,int m_w=0,int m_h=0):l(m_l),w(m_w),h(m_h){};
	bool operator<(const Block &a)const
	{
		return l<a.l||(l==a.l&&w<a.w)||(l==a.l&&w==a.w&&h<a.h);
	}
	bool operator==(const Block& a)const
	{
		return l==a.l&&w==a.w&&h==a.h;
	}
};

vector<Block> blocks;

int n;

void add_block(int m_l,int m_w,int m_h)
{
	if(m_w>m_l)
		swap(m_l,m_w);
	if(m_h>m_l)
		swap(m_l,m_h);
	if(m_h>m_w)
		swap(m_h,m_w);
	blocks.push_back(Block(m_l,m_w,m_h));
	blocks.push_back(Block(m_l,m_h,m_w));
	blocks.push_back(Block(m_w,m_h,m_l));
}

bool put_top(Block &a,Block &b)
{
	return a.l<b.l&&a.w<b.w;
}

int dp[905];

int main(int argc, char const *argv[])
{
	int cnt=0;
	while(scanf("%d", &n)&&n!=0)
	{
		blocks.clear();
		int x,y,z;
		for(int i=0;i<n;i++)
		{
			scanf("%d %d %d", &x,&y,&z);
			add_block(x,y,z);
		}
		memset(dp,0,sizeof(dp));
		sort(blocks.begin(),blocks.end());
		for(int i=blocks.size()-1;i>=0;i--)
		{
			dp[i]=blocks[i].h;
			for(int j=0;j<blocks.size();j++)
			{
				if(put_top(blocks[i],blocks[j]))
				{
					dp[i]=max(dp[i],dp[j]+blocks[i].h);
				}
			}
		}
		int ans=-1;
		for(int i=0;i<blocks.size();i++)
			ans=max(ans,dp[i]);
		printf("Case %d: maximum height = %d\n", ++cnt,ans);
	}
        return 0;
}