uva437 the tower of babylon

Perhaps you have heard of the legend of the Tower of Babylon.
Nowadays many details of this tale have been forgotten. So now, in
line with the educational nature of this contest, we will tell you the
whole story:

The babylonians had n types of blocks, and an unlimited supply of
blocks of each type. Each type-i block was a rectangular solid with
linear dimensions tex2html_wrap_inline32 . A block could be reoriented
so that any two of its three dimensions determined the dimensions of
the base and the other dimension was the height. They wanted to
construct the tallest tower possible by stacking blocks. The problem
was that, in building a tower, one block could only be placed on top
of another block as long as the two base dimensions of the upper block
were both strictly smaller than the corresponding base dimensions of
the lower block. This meant, for example, that blocks oriented to have
equal-sized bases couldn’t be stacked.

Your job is to write a program that determines the height of the
tallest tower the babylonians can build with a given set of blocks.

Input and Output

The input file will contain one or more test cases. The first line of
each test case contains an integer n, representing the number of
different blocks in the following data set. The maximum value for n is
30. Each of the next n lines contains three integers representing the values tex2html_wrap_inline40 , tex2html_wrap_inline42 and
tex2html_wrap_inline44 .

Input is terminated by a value of zero (0) for n.

For each test case, print one line containing the case number (they
are numbered sequentially starting from 1) and the height of the
tallest possible tower in the format “Casecase: maximum height
=height”

只有顶面的尺寸会影响之后的决策，所以可以用动态规划。
由于起点和终点未知，记忆化搜索会好写一点（比拓扑排序好写）。
考虑i物品，j边做高，就在所有能放在他下面的状态中找一个最大的即可【当然，也可以找所有能放在它上面的】

#include<cstdio>
#include<cstring>
int a[35][3],dp[35][3],n;
int max(int x,int y){return x>y?x:y;}
void match(int x,int &y,int &z)
{
    if (x==0)
    {
        y=1;
        z=2;
        return;
    }
    if (x==1)
    {
        y=0;
        z=2;
        return;
    }
    y=0;
    z=1;
}
int solve(int k,int p)
{
    if (dp[k][p]) return dp[k][p];
    int i,j,x1,y1,x2,y2,z;
    match(p,x1,y1);
    for (i=1;i<=n;i++)
      for (j=0;j<3;j++)
      {
        match(j,x2,y2);
        if ((a[k][x1]<a[i][x2]&&a[k][y1]<a[i][y2])||(a[k][x1]<a[i][y2]&&a[k][y1]<a[i][x2]))
          dp[k][p]=max(dp[k][p],solve(i,j));
      }
    dp[k][p]+=a[k][p];
    return dp[k][p];
}
int main()
{
    int i,j,k,m,p,q,x,y,z,cas=0,ans;
    while (scanf("%d",&n)&&n)
    {
        cas++;
        memset(dp,0,sizeof(dp));
        for (i=1;i<=n;i++)
          scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]);
        ans=0;
        for (i=1;i<=n;i++)
          for (j=0;j<3;j++)
            ans=max(ans,solve(i,j));
        printf("Case %d: maximum height = %d\n",cas,ans);
    }
}