UVA 437 The Tower of Babylon DP+记忆化

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
	return a % b == 0 ? b : gcd(b, a % b);
}
int l[120],c[120],h[120];
int N,cas;
int dp[120];
int calcu(int index)
{
    if (dp[index]!=-1) return dp[index];
    dp[index]=h[index];
    for (int i=0;i<cas;i++)
    {
        //if (i==index)continue;
        if (l[i]>l[index] && c[i]>c[index])
        dp[index]=max(dp[index],calcu(i)+h[index]);
    }
    return dp[index];
}
int main()
{
    //freopen("sample.txt","r",stdin);
    int kase=1;
    while (scanf("%d",&N)!=EOF)
    {
        if (N==0) break;
        cas=0;int a[4];
        for (int i=0;i<N;i++)
        {
            scanf("%d%d%d",&a[0],&a[1],&a[2]);
            sort(a,a+3);
            //for (int j=0;j<3;j++) printf("%d\n",a[j]);
            l[cas]=a[1];c[cas]=a[0];h[cas]=a[2];cas++;
            l[cas]=a[2];c[cas]=a[0];h[cas]=a[1];cas++;
            l[cas]=a[2];c[cas]=a[1];h[cas]=a[0];cas++;
        }
        int ans=-1;
        memset(dp,-1,sizeof(dp));
        for (int i=0;i<cas;i++)
            ans=max(ans,calcu(i));
        printf("Case %d: maximum height = %d\n",kase++,ans);
    }
    return 0;
}