HDU 4665 Unshuffle DFS找一个可行解

每层找一对相等的整数，分别放在两个不同的串中。

参考了学弟的解法，果断觉得自己老了……

#include <cstdio>
#include <cstring>
#include <cstdlib>

const int MAXN = ;

int n;
int num[MAXN];
int vis[MAXN];

bool DFS( int st, int last, int cur )
{
    if ( cur == n /  ) return true;

    for ( int i = st; i < n; ++i )
        if ( vis[i] == - )
        {
            vis[i] = ;
            for ( int j = i + ; j < n; ++j )
                if ( num[j] == num[i] && vis[j] == - && j > last )
                {
                    vis[j] = ;
                    if ( DFS( i + , j, cur +  ) )
                        return true;
                    vis[j] = -;
                }
            vis[i] = -;
            break;
        }
    return false;
}

int main()
{
    int T;
    scanf( "%d", &T );
    while ( T-- )
    {
        scanf( "%d", &n );
        for ( int i = ; i < n; ++i )
            scanf( "%d", &num[i] );

        memset( vis, -, sizeof(vis) );
        DFS( , ,  );
        for ( int i = ; i < n; ++i )
            printf( "%d", vis[i] );
        puts("");
    }
    return ;
}