POJ 1789 Truck History (prim解决最小生成树问题)

题意:  用7个小写字母来表示每种truck的型号，每两种型号之间的差距为字母串,现在给出n种不同型号的truck，问怎样使1/Σ_(to,td)d(t_o,t_d)的值最小。（即找到一条连接所有truck的最短路径)

注意: 不同字母的个数指的是相同位置的不同字母  比如c[1] != p[1].

code:

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn = 2005;
const int inf =0x3f3f3f3f3f;
int ans, n;
char str[maxn][10];
int dis[maxn][maxn];
void prim(){
	int vis[maxn], d[maxn], i, j, k;
	memset(vis, 0, sizeof(vis));
	memset(d, inf, sizeof(d));
	int MIN=inf, v=0;
	d[1]=0;
	while(true){
		MIN = inf , v = -1;
		for(i=1; i<=n; i++){
			if(!vis[i] && d[i]<MIN){
				v = i;
				MIN = d[i];
			}
		}
		if(v==-1) return ;
		vis[v] = 1;
		ans+=MIN;
		for(i=1;i<=n;i++){
			if(!vis[i] && d[i] > dis[v][i]){
				d[i] = dis[v][i];
			}
		}
	}
	return;
}
int main()
{
	int i, j, k, p;
	freopen("in.txt", "r", stdin);
	while(scanf("%d", &n), n){
		memset(dis, 0, sizeof(dis));
		ans=0;
		for(i=1; i<=n; i++){
			scanf("%s", str[i]);
			for(j=1; j<i; j++){
				int sum=0;
				for(k=0; k<7; k++){
					if(str[i][k] != str[j][k]) sum++;
				}
				dis[i][j] = dis[j][i] = sum;
			}
		}
		prim();
		printf("The highest possible quality is 1/%d.\n", ans);
	}
	return 0;
}