poj 1789：Truck History

大意就是用7个小写字母组成的字符串代表一种卡车的型号，两种型号之间不同的字母越少，则距离越短，关联性越高。于是求总关联性最高时距离总和的倒数。

 

最小生成树的题。第一次做，各种犯错，不过与以往比做题时间倒是少了不少。这题用prim算法来做，应该是算简单的那类。本来是考虑要不要用kruskal算法来做，后来想想好像很麻烦的样子，就先搁置了，下次有空再敲出来。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

const int MAXN = 2005 ;
int dis[MAXN] = {0} ;
char type[MAXN][10] = {0} ;
bool vis[MAXN] = {0} ;
int n , m , ans = 0 ;

int dist(int x , int y) {
    int diff = 0 ;
    for (int i = 0 ; i <= 6 ; i ++) {
        if (type[x][i] != type[y][i]) diff ++ ;
    }
    //cout << x << ',' << y << ',' << diff << endl ;
    return diff ;
}

void prim(int x) {
    int p_min = 10 , k = 0 ;
    for (int i = 0 ; i < n ; i ++) {
        //cout << "11111111111111111111\n" ;
        int temp = dist(x , i) ;
        if (temp < dis[i]) dis[i] = temp ;
        if (dis[i] < p_min && !vis[i]) {p_min = dis[i] ; k = i ;}
    }
/*
    for (int i = 0 ; i < n ; i ++) {
        cout << dis[i] << ',' ;
    }
    cout << endl ;
    for (int i = 0 ; i < n ; i ++) {
        cout << vis[i]? 1 : 0 << ',' ;
    }
    cout << endl ;
*/
    ans += p_min ; vis[k] = 1 ; m -- ;
    if (m) prim(k) ;
}

int main() {
    //freopen("in.txt" , "r" , stdin) ;
    while (cin >> n && n) {
        m = n - 1 ;
        ans = 0 ;
        memset(dis , 10 , sizeof(dis)) ;
        memset(type , 0 , sizeof(type)) ;
        memset(vis , 0 ,sizeof(vis)) ;

        for (int i = 0 ; i < n ; i ++) {
            scanf("%s" , type[i]) ;
        }
        /*
        for (int i = 0 ; i < n ; i ++) {
            puts(type[i]) ;
        }
        */
        for (int i = 0 ; i < n ; i ++) {
            dis[i] = dist(0 , i) ;
        }
        vis[0] = 1 ;
        prim(0) ;
        cout << "The highest possible quality is 1/" << ans << ".\n" ;
        //cout << ans << endl ;
    }
    return 0 ;
}