F - Truck History

老算法保持不变，主要是题意有点复杂，还有如果没有使用t<n-1来计数的话，会超时，还有在遍历是应该是j<i才对

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<queue>
#include<stack>
using namespace std;

const int maxn = 2005;

int f[maxn];
char p[maxn][10];
struct node
{
    int u, v, len;
    friend bool operator < (node a, node b)
    {
        return a.len > b.len;
    }
};

int Len(char a[], char b[])
{
    int sum = 0;
    for(int i=0; a[i]; i++)
        if(a[i] != b[i])sum++;

    return sum;
}
int Find(int x)
{
    if(f[x] != x)
        f[x] = Find(f[x]);
    return f[x];
}
int main()
{
    int N;
	//freopen("F.txt","r",stdin);
    while(scanf("%d", &N)&& N)
    {
        node s;
        priority_queue<node> Q;

        for(s.u=1; s.u<=N; s.u++)
        {
            f[s.u] = s.u;
            scanf("%s", p[s.u]);
            for(s.v=1; s.v<s.u; s.v++)
            {
                s.len = Len(p[s.u], p[s.v]);                
				Q.push(s);
            }
        }
        int ans = 0, t=0;//如果已经链接了N-1条边就可以结束了
        while(Q.size() && t < N-1)
        {
            s = Q.top();Q.pop();
            int u = Find(s.u), v = Find(s.v);
            //cout<<u<<v<<endl;
			if(u != v)
            {
                t++;
                f[u] = v;
                ans += s.len;
                //cout<<ans<<endl;
            }
        }
        printf("The highest possible quality is 1/%d.\n", ans);
    }
    return 0;
}