poj2718 Smallest Difference

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

10 1 2 4 6 7

Sample Output

28

代码：
题意：给出一个集合，集合里是按升序排列的个位数，且不重复。用这些集合中的数组成两个数（集合中的每个数都只能用一次），求这两个数的最小差值是多少？
题解：分情况讨论一下：
1.当集合中的数有奇数个时，大的那个数多一位，要尽可能小，小的那个数要尽可能大。
2.当集合中的数有偶数个时，取中间两个个位数数分别为两个数的开头，开头大的那个数，后面要尽可能小，开头小的那个数，后面要尽可能大。
所以很明显，这一题是可以用贪心法解决的，模拟一下上面的思路即可，这里就不给出代码了。
觉得模拟很麻烦，就掏出了STL神器，暴力枚举所有符合要求的情况，记录下最小差值即可。
枚举

#include<cstdio>#include<cmath>#include<map>#include<algorithm>#include<iostream>using namespace std;int a[12],pl;void solve(){    while(a[0] == 0) next_permutation(a,a + pl); // 首位不能为零    int ans = 99999999;    int mid = pl / 2;    do{        if(a[mid]){ // 首位不能为零            int ma = a[0],mb = a[mid];            for(int i = 1; i < mid; i++)                ma = ma * 10 + a[i];            for(int i = mid + 1;i < pl; i++)                mb = mb * 10 + a[i];            if(ans > abs(ma - mb))                ans = abs(ma-mb);        }      }while(next_permutation(a,a + pl));    cout<< ans <<endl;}int main(){    int T;    scanf("%d",&T);    while(T--){        char s;        int N;        pl = 0;        while(scanf("%d%c",&N,&s) != EOF){            a[pl++] = N;            if(s == '\n') break;        }        if(pl == 1) printf("%d\n",a[0]);        else if(pl == 2) printf("%d\n",abs(a[0] - a[1]));        else solve();    }    return 0;}