#include<iostream>
#include<cstring>
#include<algorithm>
#define MAX 2002000
using namespace std;
int parent[2002], n;
char str[2002][10];
struct node{
int s, e, v;
}g[MAX];
int distance(char a[], char b[]){
int count = 0;
for(int i = 0; i < 7; i++){
if(a[i] != b[i]) count ++;
}
return count;
}
bool cmp(node a, node b){
return a.v < b.v;
}
int find(int x){
return x == parent[x] ? x : parent[x] = find(parent[x]);
}
bool union_(int a, int b){
int fa = find(a);
int fb = find(b);
if(fa != fb){
parent[fa] = fb;
return true;
}
return false;
}
int main(){
int temp;
while(cin >> n && n){
int k = 0, sum = 0;
for(int i = 0; i < n; i++){
scanf("%s", str[i]);
}
for(int i = 0; i < n - 1; i++){
for(int j = i + 1; j < n; j++){
temp = distance(str[i], str[j]);
g[k].s = i;
g[k].e = j;
g[k].v = temp;
k ++;
}
}
sort(g, g + k, cmp);
for(int i = 0; i <= n; i++){
parent[i] = i;
}
for(int i = 0; i < k; i++){
if(union_(g[i].s, g[i].e)){
sum += g[i].v;
}
}
printf("The highest possible quality is 1/%d.\n", sum);
}
return 0;
}
poj1789——kuskal最小生成树
最新推荐文章于 2024-04-30 22:25:35 发布