10051 - Tower of Cubes----------

记忆画搜索-按原理写，让程序跑去吧！！

#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<set>
#include<vector>
#include<cstring>
#include <algorithm>
#define LL long long
#define inf 0x7fffffff
#define E 1e-9
#define M 310
#define N 501
using namespace std;
int n,h,m,e,t;
int a[N][6];
int d[N][6];
int tran[6]= {1,0,3,2,5,4};
char str[6][10]= {"front","back","left","right","top","bottom"};
int dfs(int v,int k)
{
    if(d[v][k])
        return d[v][k];
    d[v][k]=1;
    for(int i=v+1; i<n; ++i)
        for(int j=0; j<6; ++j)
            if(a[v][k]==a[i][j])
            {
                d[v][k]=max(d[v][k],dfs(i,tran[j])+1);
            }
    return d[v][k];
}
void print(int num,int k)
{
    int flag=0;
    for(int i=num+1; i<n; i++)
    {
        for(int j=0; j<6; ++j)
        {
            if(d[num][k]==d[i][j]+1&&a[num][k]==a[i][tran[j]])
            {
                printf("%d %s\n",i+1,str[tran[j]]);
                print(i,j);
                flag=1;
                break;
            }
        }
        if(flag)
            break;
    }
    return ;
}
void print2(int ma[][6],int n,int m)
{
    for (int i=0; i<n ; i++ )
    {
        printf("%d",ma[i][0]);
        for (int j=1; j<m ; j++)
            printf(" %d",ma[i][j]);
        cout<<endl;
    }
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("ex.in","r",stdin);
#endif
    int ncase=0;
    while(scanf("%d",&n),n)
    {
        if(ncase)
        printf("\n");
        memset(d,0,sizeof(d));
        for(int i=0; i<n; ++i)
            for(int j=0; j<6; ++j)
                scanf("%d",&a[i][j]);
        int maxv=1,num=0,k=0;
        for(int i=0; i<n; ++i)
            for(int j=0; j<6; ++j)
                if(dfs(i,tran[j])>maxv)
                {
                    maxv=d[i][tran[j]];
                    num=i,k=j;
                }
        printf("Case #%d\n%d\n",++ncase,maxv);
        printf("%d %s\n",num+1,str[k]);
        print(num,tran[k]);

    }
    return 0;
}