POJ 2718 Smallest Difference

分奇数和偶数两种情况进行讨论，奇数可贪心，偶数没想到贪心的方法，采用直接枚举的方法过的~~~

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 30;
const int INF = 0x3f3f3f3f;
char str[MAXN];
int  elem[MAXN], d_cnt;
bool visit[1200];
int  a[MAXN], b[MAXN];
int  T, n, ans;

inline void swap(int &a, int &b)
{
    int tmp = a;
    a = b;
    b = tmp;
}

inline int count_bit(int x)
{
    int ret = 0;
    while(x)
    {
        x &= (x-1);
        ret++;
    }
    return ret;
}

void solve(int cur)
{
    int t1 = 0, t2 = 0;
    int aa, bb;
    for(int i = 0; i < n; ++i)
    {
        if(cur & (1<<i))
            a[t1++] = elem[i];
        else
            b[t2++] = elem[i];
    }
    if(n == 2)
    {
        ans = min(ans, abs(a[0]-b[0]));
        return ;
    }
    do
    {
        if(a[0] == 0 && t1 > 1)
            continue;
        aa = 0;
        for(int i = 0; i < t1; ++i)
            aa = aa * 10 + a[i];
        do
        {
            if(b[0] == 0 && t2 > 1)
                continue;
            bb = 0;
            for(int i = 0; i < t2; ++i)
            {
                bb = bb * 10 + b[i];
            }
            ans = min(ans, (int)abs(aa-bb));
        }while(next_permutation(b, b + t2));
    }while(next_permutation(a, a + t1));
    return ;
}

void dfs(int cur, int id)
{
    if(id == n)
    {
        if(count_bit(cur) == d_cnt)
        {
            if(visit[cur] | visit[((1<<n)-1)&(~cur)])
                return ;
            solve(cur);
            visit[cur] = visit[((1<<n)-1)&(~cur)] = true;
            return ;
        }
        else
            return ;
    }
    dfs(cur | (1 << id), id + 1);
    dfs(cur, id + 1);
    return ;
}

int main()
{
    //freopen("aa.in", "r", stdin);
    //freopen("bb.out", "w", stdout);

    scanf("%d", &T); getchar();
    while(T--)
    {
        n = 0; ans = INF;
        memset(visit, false, sizeof(visit));
        gets(str); int len = strlen(str);
        for(int i = 0; i < len; ++i)
        {
            if(str[i] >= '0' && str[i] <= '9')
                elem[n] = (str[i] - '0'), n++;
        }
        if(n & 1)
        {
            int t1 = 0, t2 = 0;
            if(elem[0] == 0 && n > 2)
            {
                swap(elem[0], elem[1]);
            }
            for(int i = 0; i <= n/2; ++i)
            {
                t1 = t1 * 10 + elem[i];
            }
            for(int i = n-1; i >= n/2+1; --i)
            {
                t2 = t2 * 10 + elem[i];
            }
            cout << (int)abs(t1-t2) << endl;
        }
        else
        {
            d_cnt = n / 2;
            dfs(0, 0);
            cout << ans << endl;
        }
    }
    return 0;
}