poj1789 Truck History

题目链接：http://poj.org/problem?id=1789
题意：简化的题意，大概就是有n个字符串，可以看成n个结点，每个结点之间的权值为两个字符串之间不同的字符个数，现在让你求这个图的最小生成树
解析：最小生成树裸题

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 2e6+100;
struct node
{
    int u,v,c;
    node() {}
    node(int _u,int _v,int _c)
    {
        u = _u;
        v = _v;
        c = _c;
    }
    bool operator < (const node &b)const
    {
        return c<b.c;
    }
}a[maxn];
char s[2005][10];
int fa[maxn];
int getfa(int x)
{
    if(fa[x]==x)
        return fa[x];
    return fa[x] = getfa(fa[x]);
}

int main(void)
{
    int n;
    while(~scanf("%d",&n)&&n)
    {

        for(int i=1;i<=n;i++)
        {
            scanf("%s",s[i]);
            fa[i] = i;
        }
        int len = strlen(s[1]),cnt = 0,ans = 0;
        for(int i=1;i<=n;i++)
        {
            for(int j=i+1;j<=n;j++)
            {
                int sum = 0;
                for(int k=0;k<len;k++)
                {
                    if(s[i][k]!=s[j][k])
                        sum++;
                }
                a[cnt++] = node(i,j,sum);
            }
        }
        sort(a,a+cnt);
        for(int i=0;i<cnt;i++)
        {
            int t1 = getfa(a[i].u);
            int t2 = getfa(a[i].v);
            if(t1!=t2)
            {
                ans += a[i].c;
                fa[t1] = t2;
            }
        }
        printf("The highest possible quality is 1/%d.\n",ans);
    }
    return 0;
}