UVA 437 The Tower of Babylon 【dp】

https://vjudge.net/problem/UVA-437

注意：任意两个自己都有一条边相等，所以不能自己堆在自己身上

#include<cstdio>
#include<math.h>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<list>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
#define abs(x) (x>0?x:-x)
const int INF=0x7ffffff;
const ll MAX=1e18;

const int M=230;
int n;
bool g[M][M];
int f[M];

struct Node
{
  int x,y,h;
}a[M];

bool cheak(int i,int j)
{
    return a[i].x<a[j].x&&a[i].y<a[j].y||
    a[i].x<a[j].y&&a[i].y<a[j].x;
}

int dfs(int u)
{
    if(f[u]!=-1)return f[u];
    f[u]=a[u].h;
    for(int i=0;i<n;i++){
        if(g[u][i]){
            f[u]=max(f[u],dfs(i)+a[u].h);
        }
    }
    return f[u];
}

int main()
{
    int cas=1;
    while(~scanf("%d",&n),n){
        for(int i=0;i<n;i++){
            scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].h);
            a[n+i].x=a[i].x;a[n+i].y=a[i].h;a[n+i].h=a[i].y;
            a[2*n+i].x=a[i].h;a[2*n+i].y=a[i].y;a[2*n+i].h=a[i].x;
        }
        n*=3;
        MS(g,0);
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                g[i][j]=cheak(i,j);
                g[j][i]=cheak(j,i);
            }
        }
        int ans=0;
        MS(f,-1);
        for(int i=0;i<n;i++){
            ans=max(ans,dfs(i));
        }
        printf("Case %d: maximum height = %d\n",cas++,ans);
    }
    return 0;
}