poj1789

prim。

#include<iostream>
#include<string>
#include<cstring>
using namespace std;
const int inf = 1e9;
int n;
string a[2005];
int e[2005][2005];
int d[2005];
bool vis[2005];
int res;
void prim()
{
    memset(vis, false, sizeof(vis));
    for(int i = 0; i < n; i ++)
        d[i] = e[0][i];
    vis[0] = true;
    int tmp, tmp2;
    for(int i = 0; i < n - 1; i ++)
    {
        tmp = inf;
        for(int j = 0; j < n; j ++)
            if(!vis[j] && tmp > d[j])
            {
                tmp = d[j];
                tmp2 = j;
            }
        res += tmp;
        vis[tmp2] = true;
        for(int j = 0; j < n; j ++)
            if(d[j] > e[tmp2][j])
                d[j] = e[tmp2][j];
    }
}

int main()
{
    while(cin >> n && n)
    {
        memset(e, 0, sizeof(e));
        res = 0;
        for(int i = 0; i < n; i ++)
            cin >> a[i];
        int tmp;
        for(int i = 0; i + 1 < n; i ++)
            for(int j = i + 1; j < n; j ++)
            {
                tmp = 0;
                for(int k = 0; k < 7; k ++)
                    if(a[i][k] != a[j][k])
                        tmp ++;
                e[i][j] = e[j][i] = tmp;
            }
        prim();
        cout << "The highest possible quality is 1/" << res << "." << endl;
    }
    // system("pause");
    return 0;
}