Poj 1789 Truck History

1Y

prim模板一套

完事大吉

#include<stdio.h>#include<algorithm>#include<string.h>#define INF ((int)1e9)#define N 2010using namespace std;int G[N][N];int low[N];char map[N][10];int cmp(int x,int y){    int len=strlen(map[x]);    int i;    int res=0;    for(i=0;i<len;i++)if(map[x][i]!=map[y][i])res++;    return res;    }int main(){    int n;    while(scanf("%d",&n)!=EOF&&n){        int i,j;        for(i=1;i<=n;i++)scanf("%s",map[i]);        for(i=1;i<=n;i++)for(j=1;j<=n;j++)G[i][j]=cmp(i,j);        for(i=1;i<=n;i++)low[i]=G[1][i];        int res=0;        for(i=2;i<=n;i++){            int in=INF,pmin;            for(j=2;j<=n;j++)if(low[j]&&low[j]<in)in=low[j],pmin=j;            low[pmin]=0;res+=in;            for(j=2;j<=n;j++)low[j]=min(low[j],G[pmin][j]);            }        printf("The highest possible quality is 1/");        printf("%d.\n",res);        }    return 0;    }