//
http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19214
代码还是有点麻烦, 网上说还可以是将面积排序转化成一个最大上升子序列问题, 不懂
不过自己想了会儿终于知道DAG是什么了, 基础知识不扎实, 拓扑不熟, 自己推得, 以后熟悉了其他的会补上
进步最大的是有些题可以将物体转化成一个点, 进而成图, 方便很多
//
#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 6 * 30 + 5;
int dp[maxn];
int k[maxn];
int res[maxn][maxn];
int N;
struct point
{
int a, b, h;
}vis[maxn];
int solve(int i)
{
if(k[i] != -1) return dp[i];
int Max = 0;
for(int j = 1; j <= 6*N; ++j)
{
if(res[i][j])
{
Max = max(Max, solve(j));
}
}
k[i] = 1;
return dp[i] = dp[i] + Max;
}
int main()
{
int kase = 0;
while(cin >> N && N)
{
memset(k, -1,sizeof(k));
memset(res,0,sizeof(res));
memset(vis,0,sizeof(vis));
int a, b, c;
for(int i = 1; i <= 6*N; i+=6)
{
scanf("%d%d%d", &a, &b, &c);
vis[i].a = a, vis[i].b = b, vis[i].h = c;
vis[i+1].a = a, vis[i+1].b = c, vis[i+1].h = b;
vis[i+2].a = b, vis[i+2].b = a, vis[i+2].h = c;
vis[i+3].a = b, vis[i+3].b = c, vis[i+3].h = a;
vis[i+4].a = c, vis[i+4].b = a, vis[i+4].h = b;
vis[i+5].a = c, vis[i+5].b = b, vis[i+5].h = a;
}
for(int i = 1; i <= 6*N; ++i)
{
for(int j = 1; j <= 6*N; ++j)
{
if(vis[i].a > vis[j].a && vis[i].b > vis[j].b)
{
res[i][j] = 1;
}
}
}
for(int i = 1; i <= 6*N; ++i)
{
dp[i] = vis[i].h;
}
solve(1);
int ans = -1;
for(int i = 1; i <= 6*N; ++i)
{
if(solve(i) > ans) ans = dp[i];
}
printf("Case %d: maximum height = %d\n", ++kase, ans);
}
return 0;
}