UVA - 140 Bandwidth

//枚举排列的一个应用吧

#include<cstdio>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;

const int maxn = 26;

int vis[maxn][maxn];
int res[maxn];
int ans[maxn];
int k[maxn];
int main()
{
    string kk;
    while(getline(cin, kk)&& kk!="#")
    {
        memset(vis, 0, sizeof(vis));
        memset(res, 0, sizeof(res));
        int kkk;
        for(int i = 0; i < kk.size(); ++i)
        {
            if(kk[i]==':' || kk[i]==';')  continue;
            if(kk[i+1]==':')  kkk = kk[i] - 'A';
            else
            {
                vis[kkk][kk[i]-'A'] = vis[kk[i]-'A'][kkk] = 1;
            }
            if(kk[i] >= 'A' && kk[i] <= 'Z')  res[kk[i]-'A'] = 1;
        }
        int cnt = 0;
        for(int i = 0; i < 26; ++i)
        {
            if(res[i]) ans[cnt++] = i;
        }
        sort(ans, ans+cnt);
        int min_num = 26;
        do{
            int max_num = 0;
            for(int i = 0; i < cnt-1; i++)
            {
                for(int j = i+1; j < cnt; j++)
                {
                    if(vis[ans[i]][ans[j]])
                    {
                        max_num = max(max_num, j-i);
                    }
                }
            }
            if(max_num < min_num){
                min_num = max_num;
                memcpy(k, ans, sizeof(ans));
            }
        }while(next_permutation(ans, ans+cnt));

        for(int i = 0; i < cnt; i++)
            printf("%c ", k[i]+'A');
        printf("-> %d\n", min_num);
    }
}