POJ - 1789 Truck History

 

Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a truck. The code is simply a string of exactly seven lowercase letters (each letter on each position has a very special meaning but that is unimportant for this task). At the beginning of company's history, just a single truck type was used but later other types were derived from it, then from the new types another types were derived, and so on. 

Today, ACM is rich enough to pay historians to study its history. One thing historians tried to find out is so called derivation plan -- i.e. how the truck types were derived. They defined the distance of truck types as the number of positions with different letters in truck type codes. They also assumed that each truck type was derived from exactly one other truck type (except for the first truck type which was not derived from any other type). The quality of a derivation plan was then defined as 

1/Σ(to,td)d(to,td)

where the sum goes over all pairs of types in the derivation plan such that t o is the original type and t d the type derived from it and d(t o,td) is the distance of the types. 
Since historians failed, you are to write a program to help them. Given the codes of truck types, your program should find the highest possible quality of a derivation plan. 

Input

The input consists of several test cases. Each test case begins with a line containing the number of truck types, N, 2 <= N <= 2 000. Each of the following N lines of input contains one truck type code (a string of seven lowercase letters). You may assume that the codes uniquely describe the trucks, i.e., no two of these N lines are the same. The input is terminated with zero at the place of number of truck types.

Output

For each test case, your program should output the text "The highest possible quality is 1/Q.", where 1/Q is the quality of the best derivation plan.

Sample Input

4
aaaaaaa
baaaaaa
abaaaaa
aabaaaa
0

Sample Output

The highest possible quality is 1/3.

 

题目大意： 以每i行的字符串（车牌）为基准，求第i行与其他行的差值，每个车牌的之间都有权值，求得一个所有车牌间的总权值Q，使得1/Q为高质量，说明Q最小，即最小生成树。

思路：加权无向图。转：http://www.cnblogs.com/Tree-dream/p/5565072.html

     举例：  

                     abaaaba                       以第一行为基准与各行的差值为 0 2 6 1

                     baaaaba                       以第二行为基准与各行的差值为 2 0 4 3

                     baabbab                       以第三行为基准与各行的差值为 6 4 0 5

                     abaaaaa                       以第四行为基准与各行的差值为 1 3 5 0

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
int e[2010][2010];
int dis[2010];
int book[2010];
char s[2010][10];
int n;
int ans;
void creat()
{
    int i,j,k;
    int num;
    for(i=0; i<n; i++)
    {
        for(j=0; j<n; j++)
        {
            num=0;
            for(k=0; k<7; k++)
            {
                if(s[i][k]!=s[j][k])
                    num++;
            }
            e[i][j]=num;
        }
    }
}
void dijkstra()
{
    memset(book,0,sizeof(book));
    for(int i=0; i<n; i++)
        e[i][i]=0;
    for(int i=0; i<n; i++)
        dis[i]=e[0][i];
//    book[0]=1;
    int mi,u;
    for(int i=0; i<n; i++)
    {
        mi=inf;
        for(int j=0; j<n; j++)
        {
            if(!book[j]&&dis[j]<mi)
            {
                mi=dis[j];
                u=j;
            }
        }
        ans+=mi;
        book[u]=1;
        for(int v=0; v<n; v++)
        {
            if(!book[v]&&dis[v]>e[u][v])//**********
                dis[v]=e[u][v];//**************
        }
    }
}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        ans=0;
        for(int i=0; i<n; i++)
            scanf("%s",&s[i]);
        creat();
        dijkstra();
        printf("The highest possible quality is 1/%d.\n",ans);
    }
    return 0;
}