POJ 1789 Truck History 最小生成树

题意：每个卡车有对应标码，定义不同卡车之间的距离为标码中每个位置对应字符不同的个数，每个卡车只能诞生于另一索引在其之前的卡车，运输质量定义为1/Q，Q为所有两个不同卡车的距离之和，求出最大运输质量
思路：以距离即不同字符数为权值，求最小生成树即可

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 2e3+5;
const int inf = 0x3f3f3f3f;
int n, u[maxn];
char s[maxn][10];
struct node {
	int u, v, w;
	node(int u = 0, int v = 0, int w = 0) : u(u), v(v), w(w) {}
};
vector<node> edge;
bool cmp(node x, node y)
{
	return x.w < y.w;
}
int ufind(int x)
{
	if (u[x] != x)
		u[x] = ufind(u[x]);
	return u[x];
}
void unite(int x, int y)
{
	u[ufind(x)] = ufind(y);
}
int main()
{
	while (~scanf("%d", &n) && n) {
		edge.clear();
		for (int i = 0; i < n; i++) {
			scanf("%s", s[i]);
			u[i] = i;
		}
		for (int i = 0; i < n; i++) {
			for (int j = i+1; j < n; j++) {
				int sum = 0;
				for (int k = 0; k < 7; k++) {
					if (s[i][k] != s[j][k])
						sum++;
				}
				edge.push_back(node(i, j, sum));
			}
		}
		sort(edge.begin(), edge.end(), cmp);
		int k = 0, res = 0;
		for (int i = 0; i < edge.size(); i++) {
			int x = edge[i].u, y = edge[i].v;
			if (ufind(x) != ufind(y)) {
				unite(x, y);
				k++;
				res += edge[i].w;
			}
			if (k == n-1)
				break;
		}
		printf("The highest possible quality is 1/%d.\n", res);
	}
	return 0; 
}