UVa 820 - Bandwidth 全排列+判断

题意：给出字母的连接情况，带宽是字母排列时相连的字母间距的最大值，要求找出一个排列使带宽最小。

结点不会大于8，于是也用next_permutation进行排列后判断，其实这个排列也可以剪枝减掉一半的，我倒是没处理，不过时间较长。

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;
const int maxn = 30;

int g[maxn][maxn];
int Min, rec[10], arr[10];
char ch[200], len, n;
bool app[maxn], vis[maxn];

void solve() {
	int bw = 0;
	memset (vis, 0, sizeof(vis));
	for (int i = 0; i < n; i++) {
		vis[arr[i]] = true;
		for (int j = 0; j < n; j++)
			if (g[arr[i]][arr[j]]) {
				vis[arr[j]] = true;
				bw = max(abs(i - j), bw);
			}
	}
	if (bw < Min) {
		Min = bw;
		for (int i = 0; i < n; i++)
			rec[i] = arr[i];
	}
}

int main() {
	while (gets(ch) && ch[0] != '#') {
		len = strlen(ch);
		memset(app, 0, sizeof(app));
		memset(g, 0, sizeof(g));
		for (int i = 0; i < len; i++) {
			int a = ch[i] - 'A', b;
			app[a] = true;
			for (i += 2; ch[i] != ';' && i < len; i++) {
				b = ch[i] - 'A';
				app[b] = true;
				g[a][b] = g[b][a] = 1;
			}
		}
		n = 0;
		for (int i = 0; i < maxn; i++)
			if (app[i])
				arr[n++] = i;
		Min = 0x7fffffff;
		do {
			solve();
		} while (next_permutation(arr, arr + n));
		for (int i = 0; i < n; i++)
			printf("%c ", rec[i] + 'A');
		printf("-> %d\n", Min);
	}
	return 0;
}