The Tower of Babylon UVA - 437  模板题

可作为DAG中最长路问题模板

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<assert.h>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<sstream>
#include<stack>
#include<queue>
#include<string>
#include<bitset>
#include<algorithm>
#pragma warning(disable:4996)
#define me(s)  memset(s,0,sizeof(s))
#define _for(i,a,b) for(int i=(a);i<(b);++i)
#define _rep(i,a,b) for(int i=(a);i<=(b);++i)
#define Max(a,b) (a)>(b)?(a):(b);
#define Min(a,b) (a)<(b)?(a):(b);
using namespace std;
typedef pair <int, int> P;
typedef long long ll;
typedef unsigned long long llu;
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const int dr[] = { 0, -1, 0, 1, -1, -1, 1, 1 };
const int dc[] = { -1, 0, 1, 0, -1, 1, -1, 1 };
const int MOD = 1e9 + 7;
const double pi = acos(-1.0);
const double eps = 1e-15;
const int MAXN = 100 + 10;
const int MAXT = 50 + 10;
int n, x, y, z, num;
int h[MAXN];
P square[MAXN];
int G[MAXN][MAXN];
int d[MAXN];
void get_num()
{
	h[num] = x; square[num].first = min(y, z); square[num++].second = max(y, z);
	h[num] = y; square[num].first = min(x, z); square[num++].second = max(x, z);
	h[num] = z; square[num].first = min(x, y); square[num++].second = max(x, y);
}
int dp(int k)
{
	int &ans = d[k];
	if (ans > 0) return ans;
	ans = h[k];
	_rep(i, 1, num)
		if (G[k][i]) ans = max(ans, dp(i) + h[k]);
	return ans;
}
int main()
{
	
	for(int kcase=1; scanf("%d", &n) == 1 && n;kcase++)
	{
		num = 1;
		_for(i, 0, n) {
			scanf("%d%d%d", &x, &y, &z);
			get_num();
		}
		me(G);;
		_rep(i,1,num)
			_rep(j, 1, num) {
			if (i == j) continue;
			if (square[i].first < square[j].first&&square[i].second < square[j].second) G[i][j] = 1;
		}
		memset(d, -1, sizeof(d));
		int ans = 0;
		_rep(i, 1, num) 
			ans = max(ans, dp(i));

		printf("Case %d: maximum height = %d\n", kcase,ans);
	}
}