POJ 1789

【题目分析】
kruskal。

---

【代码】

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n,f[2001];
char s[2001][10];
int rank[4000001];
int fr[4000001],to[4000001],w[4000001],en=1;
inline void add(int a,int b,int c)
{fr[en]=a;to[en]=b;w[en]=c;en++;}
inline bool cmp(int a,int b)
{return w[a]<w[b];}
inline void init()
{
    en=1;
//  scanf("%d",&n);
    for (int i=1;i<=n;++i)
        scanf("%s",s[i]);
    for (int i=1;i<n;++i)
        for (int j=i+1;j<=n;++j)
        {
            int tmp=0;
            for (int k=0;k<7;++k)
                if (s[i][k]!=s[j][k]) tmp++;
            add(i,j,tmp);
        }
    for (int i=1;i<=n;++i) f[i]=i;
    for (int i=1;i<en;++i) rank[i]=i;
    sort(rank+1,rank+en,cmp);
}
inline int gf(int k)
{
    if (f[k]==k) return k;
    else return f[k]=gf(f[k]);
}
inline int kru()
{
    int cnt=0,ret=0;
    for (int i=1;i<en;++i)
    {
        int lf=gf(fr[rank[i]]),rf=gf(to[rank[i]]);
        if (rf!=lf)
        {
            ret+=w[rank[i]];
            cnt++;
            if (cnt==n-1) return ret;
            f[lf]=rf;
        }
    }
}
int main()
{
    while (scanf("%d",&n)!=EOF&&n)
    {
        init();
        printf("The highest possible quality is 1/%d.\n",kru());
    }
}