暑期dp46道(46)--HDOJ 1069

题目链接：HDOJ 1069

算水题了，重点就是 把n种block细分成3n种；

AC CODE:

#include<cstdio>
#include<string>
#include<cstring>
#include<queue>
#include<climits>
#include<algorithm>
using namespace std;

#define debug 0
#define M(a) memset(a,0,sizeof(a))
#define Max(a,b) ((a>b)?a:b)
#define REP(o) for(int i=1;i<=o;i++)

const int maxn = 30 + 5;
struct R{
	int l;
	int w;
	int h;
}data[3 * maxn];
int n, num;
int dp[3 * maxn];

bool cmp(const R a, const R b)
{
	if (a.l == b.l)
		return a.w > b.w;
	return a.l > b.l;
}

void Do(){
	int ans = 0;
	sort(data + 1, data + 3 * n + 1, cmp);												//排序   
	for (int i = 1; i <= 3 * n; i++)
	{
		dp[i] = data[i].h;
		for (int j = i - 1; j >= 1; j--)
		{
			if (data[j].l>data[i].l&&data[j].w>data[i].w&&dp[j] + data[i].h>dp[i])		//下方的block一定要满足l,w严格比上方大
			{
				dp[i] = dp[j] + data[i].h;													//dp
			}
		}
		ans = Max(ans, dp[i]);
	}
	printf("Case %d: maximum height = %d\n", num, ans);
}

int main(){
#if debug
	freopen("in.txt", "r", stdin);
#endif//debug
	num = 0;
	int a[4];
	while (~scanf("%d", &n) && n)
	{
		num++;
		M(dp);
		int t = 1;
		REP(n)
		{
			for (int j = 1; j<4; j++)								//转成3*n种各不相同的箱子。
				scanf("%d", &a[j]);
			sort(a + 1, a + 4);
			data[t].l = a[1];
			data[t].w = a[2];
			data[t++].h = a[3];
			data[t].l = a[1];
			data[t].w = a[3];
			data[t++].h = a[2];
			data[t].l = a[2];
			data[t].w = a[3];
			data[t++].h = a[1];
			//	printf("i=%d,h[i]=%d,w[i]=%d,l[i]=%d\n",i,h[i],w[i],l[i]);
		}
		Do();
	}
	return 0;
}