poj1789_最小生成树

poj1789最小生成树

#include<stdio.h>
#include<algorithm>
using namespace std;

struct node{
	
	int u,v,w;
	
}edge[2000505];

int p[2005];

int cmp(node a,node b)
{
	return a.w<b.w;
}

int find(int x)
{
	return p[x]==x?x:p[x]=find(p[x]);
}

int join(int a,int b)
{
	int x=find(a);
	int y=find(b);
	if(x!=y)
	{
		p[y]=x;
		return 1;
	}
	return 0;
}

int main()
{
	int n;
	while(scanf("%d",&n),n)
	{
		
      char s[20005][10];
	  int i,j,k,sum=0,count=0;

	  getchar();
	  for(i=0;i<n;i++)
	     scanf("%s",s[i]);
	     
	  for(i=0;i<n;i++)
	     p[i]=i;
	     
	  int t=0;
	  for(i=0;i<n;i++)
	     {
	     	for(j=i+1;j<n;j++)
	     	{
	     		int cnt=0;
	     		for(k=0;k<7;k++)
	     		{
	     			if(s[i][k]!=s[j][k])
	     			   cnt++;
	     		}
	     		edge[t].u=i;
	     		edge[t].v=j;
	     		edge[t++].w=cnt;
	     	}
	     }
	     sort(edge,edge+t,cmp);
	     
	     for(i=0;i<t;i++)
	     {
	     	if(join(edge[i].u,edge[i].v))
	     	{
	     		count++;
	     		sum+=edge[i].w;
	     	} 
			if(count==n-1)
			    break;
	     }
	     
	     printf("The highest possible quality is 1/%d.\n",sum);
	  
	} 
	return 0;
}