Truck History（prime）

Truck History

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 31871		Accepted: 12427

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.

Sample Input

4
aaaaaaa
baaaaaa
abaaaaa
aabaaaa
0

Sample Output

The highest possible quality is 1/3.

題意：

給你一個n；

n個長爲7的字符串；

每一個字符串表示一個節點，每一個節點向其餘全部點都有邊，邊長爲兩個節點字符串同一位置不一樣字符的數量；

須要你生成最短路的邊權和。

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
#define N 2010
#define M 10

char str[N][M];//放字符串 
int n;//結點數 
int vis[N],dst[N],map[N][N]; //vis訪問數組，dst放各點到MST的最小距離 

int finddst(int i,int j)//找兩字符串字符不一樣的列數 
{
	int num=0,k;
	
	for (k=0;k<7;k++)
	{
		if(str[i][k]!=str[j][k])
		{
			num++;
		}
	}
	return num;
}

void init()
{
	int j,i;
	
	memset(vis,0,sizeof(vis));//訪問數組初始 
	for (i=0;i<n;i++)//初始化圖 
	{
		for (j=0;j<n;j++)
		{
			if (i==j)
			{
				map[i][j]=0;
			}
			
			map[i][j]=finddst(i,j);			
		}
	}
}

void prime()
{
	int i,j,min,point,ans=0;
	
	vis[0]=1;//0點放入MST 
	for (i=0;i<n;i++)//dst初始化 
	{
		dst[i]=map[i][0];
	}
	
	for (i=1;i<n;i++)
	{
		min=N;
		for (j=0;j<n;j++)//找距MST最近的點 
		{
			if (vis[j]==0&&min>dst[j])
			{
				min=dst[j];
				point=j;
			}
		}
		
		if (min==N)//不連通狀況 
		{
			break;
		}
		
		vis[point]=1;//把該點放入MST 
		ans=ans+dst[point];
		
		for (j=0;j<n;j++)//更新各點到MST的最小距離 
		{
			if (vis[j]==0&&dst[j]>map[point][j])
			{
				dst[j]=map[point][j];
			}
		}
	}
	
	printf("The highest possible quality is 1/%d.\n",ans);
}

int main()
{
	int i,j;
	
	while (scanf("%d",&n)&&n)
	{
		for (i=0;i<n;i++)
		{
			scanf("%s",&str[i]);
		}
		
		init();
		prime();
	}
	
	return 0;
}