uva 140 next— primutation（）的用法

#include <bits/stdc++.h>
using namespace std;
const int maxn = 10;
int id[256], letter[maxn], n, head;
void map_id_letter(const string &s)
{
    n = 0;
    for (int c = 'A'; c <= 'Z'; c++)
        if (s.find(c) != -1)
        {
            id[c] = n;
            letter[n] = c;
            n++;//把每一个字母转换成唯一对应的数字
        }
}
int main(int argc, char const *argv[])
{
    string inp;
    while (cin >> inp && inp[0] != '#')
    {
        map_id_letter(inp);
        vector<pair<int, int>>edge;
        for (int i = 0; i < inp.size(); i++)
        {
            if (i == 0 || inp[i - 1] == ';')
                head = inp[i];
            else if (isalpha(inp[i]))//加入边
                edge.push_back(make_pair(id[head], id[inp[i]]));
        }
        int ans = n;
        int P[maxn], bestP[maxn], pos[maxn];
        for (int i = 0; i < n; i++) P[i] = i;//初始化排列0123456
        do
        {
            for (int i = 0; i < n; i++) pos[P[i]] = i;//确认排列中元素的位置，就是用p[i]索引出i
            int bandwidth = 0;
            for (int i = 0; i < edge.size(); i++)//对于每一条遍计算他的距离
                bandwidth = max(bandwidth, abs(pos[edge[i].first] - pos[edge[i].second]));
            if (bandwidth < ans)
            {
                ans = bandwidth;
                memcpy(bestP, P, sizeof(P));
            }
        }
        while (next_permutation(P, P + n));
        for (int i = 0; i < n; i++)
            printf("%c ", letter[bestP[i]]);//把数字排列转换成字母输出
        printf("-> %d\n", ans);
    }
    return 0;
}

灰常灰常纯净的暴力，但是很优雅 

用了0.006s