poj1789 最小生成树

题目连接：http://poj.org/problem?id=1789

Description

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(t_o,t_d)
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,t_d) 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.

题目大意：

给一堆长度固定为7的只含小写英文字母的字符串，每两个字符串之间的距离定义为他们不同的字母个数，求最小生成树。

解题思路：

很直接的最小生成树，由题意这是一个完全图，所以选prim算法，有多组输入，注意一下初始化即可。

代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define MAX 2005
#define INF 14005
using namespace std;

int G[MAX][MAX];
int d[MAX];
};
char a[MAX][MAX];
int n;

int prim(int s)
{
    vis[s]=;
    ;i<n;i++)
        d[i]=G[s][i];
    int now,m;
    ;
    ;i<n;i++)
    {
        m=INF;
        ;j<n;j++)
        {
            if(!vis[j]&&d[j]<m)
            {
                now=j;
                m=d[j];
            }
        }
        vis[now]=;
        res+=m;
        ;j<n;j++)
        {
            if(!vis[j]&&d[j]>G[now][j])
                d[j]=G[now][j];
        }
    }
    return res;
}

void init()
{
    memset(vis,,sizeof(vis));
    ;i<n;i++)
        ;j<n;j++)
            G[i][j]=INF;
}

int getdis(char * a,char * b)
{
    ;
    ;i<;i++)
    {
        if(a[i]!=b[i])
            res++;
    }
    return res;
}

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        )
            ;
        init();
        ;i<n;i++)
            scanf("%s",a[i]);
        ;i<n;i++)
            ;j<n;j++)
                G[i][j]=getdis(a[i],a[j]);
        printf());
    }
}