POJ 2718 Smallest Difference dfs枚举两个数差最小

Smallest Difference

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 19528		Accepted: 5329

Description

Given a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in some order. The remaining digits can be written down in some order to form a second integer. Unless the resulting integer is 0, the integer may not start with the digit 0.

For example, if you are given the digits 0, 1, 2, 4, 6 and 7, you
can write the pair of integers 10 and 2467. Of course, there are many
ways to form such pairs of integers: 210 and 764, 204 and 176, etc. The
absolute value of the difference between the integers in the last pair
is 28, and it turns out that no other pair formed by the rules above can
achieve a smaller difference.

Input

The
first line of input contains the number of cases to follow. For each
case, there is one line of input containing at least two but no more
than 10 decimal digits. (The decimal digits are 0, 1, ..., 9.) No digit
appears more than once in one line of the input. The digits will appear
in increasing order, separated by exactly one blank space.

Output

For
each test case, write on a single line the smallest absolute difference
of two integers that can be written from the given digits as described
by the rules above.

Sample Input

1
0 1 2 4 6 7

Sample Output

28

题意：n个数字分成两部分，构成两个整数，求这两个整数的最小差

题解：1、直接用函数next_pertumation()全排列
2、用dfs实现next_pertumation()功能

#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;
int t,cnt,ans;
int a[];
string s;

int main()
{
    cin>>t;
    getchar();
    while(t--)
    {
        cnt=,ans=;
        getline(cin,s);
        for(int i=;s[i];i++)
        {
            if(isdigit(s[i]))
                a[cnt++]=s[i]-'';
        }
        if(cnt==)//特例判断 0 1
        {
            cout<<abs(a[]-a[])<<endl;
            continue;
        }
        while(a[]==)//如果首位数为0，在排一次序之后就不是了
            next_permutation(a,a+cnt);
        do
        {
            if(a[cnt/]!=)//首位不能为0
            {
                int num1=,num2=;
                for(int i=;i<cnt/;i++)
                    num1=num1*+a[i];
                for(int i=cnt/;i<cnt;i++)
                    num2=num2*+a[i];
                ans=min(ans,abs(num1-num2));
            }

        }while(next_permutation(a,a+cnt));
        cout<<ans<<endl;
    }
    return ;
}

#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;
int t,cnt,ans;
int a[],b[],vis[];
string s;

void dfs(int dep)
{
    if(dep==cnt)
    {
        int num1=,num2=;
        for(int i=;i<cnt/;i++)
            num1=num1*+b[i];
        for(int i=cnt/;i<cnt;i++)
            num2=num2*+b[i];
        ans=min(ans,abs(num1-num2));
        return ;
    }

    for(int i=;i<cnt;i++)
    {
        if(vis[i]==)
            continue;
        if(dep==&&a[i]==)
            continue;
        if(dep==cnt/&&a[i]==)
            continue;
        vis[i]=;
        b[dep]=a[i];
        dfs(dep+);
        vis[i]=;
    }
}
int main()
{
    cin>>t;
    getchar();
    while(t--)
    {
        memset(vis,,sizeof(vis));
        cnt=,ans=;
        getline(cin,s);
        for(int i=;s[i];i++)
        {
            if(isdigit(s[i]))
                a[cnt++]=s[i]-'';
        }
        if(cnt==)
        {
            cout<<abs(a[]-a[])<<endl;
            continue;
        }
        if(cnt==)//防止tle
        {
            cout<<<<endl;
            continue;
        }
        dfs();
        cout<<ans<<endl;
    }
    return ;
}