输入一列代表卡车符号,每种卡车相对应的符号有多少个不同,他们之间就有多大的差别
所有的卡车都是从另一个卡车生成的(除了第一辆卡车),求如果生成其他卡车,distance of the types(种类差别的距离)最小
解法:
将所有的卡车编码看成点,任何两辆卡车的距离看成边,用普利姆算法求最小生成树即可
Description
Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a truck. The code is simply a string of exactly seven lowercase letters (each letter on each position has a very special meaning but that is unimportant for this task). At the beginning of company's history, just a single truck type was used but later other types were derived from it, then from the new types another types were derived, and so on.
Today, ACM is rich enough to pay historians to study its history. One thing historians tried to find out is so called derivation plan -- i.e. how the truck types were derived. They defined the distance of truck types as the number of positions with different letters in truck type codes. They also assumed that each truck type was derived from exactly one other truck type (except for the first truck type which was not derived from any other type). The quality of a derivation plan was then defined as
1/Σ(to,td)d(to,td)
where the sum goes over all pairs of types in the derivation plan such that t o is the original type and t d the type derived from it and d(t o,t d) is the distance of the types.
Since historians failed, you are to write a program to help them. Given the codes of truck types, your program should find the highest possible quality of a derivation plan.
Today, ACM is rich enough to pay historians to study its history. One thing historians tried to find out is so called derivation plan -- i.e. how the truck types were derived. They defined the distance of truck types as the number of positions with different letters in truck type codes. They also assumed that each truck type was derived from exactly one other truck type (except for the first truck type which was not derived from any other type). The quality of a derivation plan was then defined as
where the sum goes over all pairs of types in the derivation plan such that t o is the original type and t d the type derived from it and d(t o,t d) is the distance of the types.
Since historians failed, you are to write a program to help them. Given the codes of truck types, your program should find the highest possible quality of a derivation plan.
Input
The input consists of several test cases. Each test case begins with a line containing the number of truck types, N, 2 <= N <= 2 000. Each of the following N lines of input contains one truck type code (a string of seven lowercase letters). You may assume that the codes uniquely describe the trucks, i.e., no two of these N lines are the same. The input is terminated with zero at the place of number of truck types.
Output
For each test case, your program should output the text "The highest possible quality is 1/Q.", where 1/Q is the quality of the best derivation plan.
Sample Input
4 aaaaaaa baaaaaa abaaaaa aabaaaa 0
Sample Output
The highest possible quality is 1/3.
#include <iostream>
#include <string>using namespace std;
#define ARRSIZE 2010
const int inf=10; //无穷大(两点间边权最大为7)
char str[ARRSIZE][8];
int dist[ARRSIZE][ARRSIZE]={0};
int n;
int weight(int i,int j)
{
int count=0;
for(int k=0;k<7;k++)
if(str[i][k]!=str[j][k])
count++;
return count;
}
int prim()
{
int source=0;
int m=1;//m集合个数
bool ved[ARRSIZE];
int power=0;
int minDistance;
int minVex;
int minDis[ARRSIZE];
memset(minDis,inf,sizeof(minDis));
memset(ved,0,sizeof(ved));
ved[0]=1;
while(1)
{
if(m==n)
break;
//1.源点寻找各种边
minDistance=inf;
for(int i=1;i<n;i++)
{
if(!ved[i] && dist[source][i]<minDis[i])
minDis[i]=dist[source][i];
if(!ved[i] && minDis[i]<minDistance)
{
minVex=i;
minDistance=minDis[i];
}
}
power+=minDistance;
ved[minVex]=1;
m++;
source=minVex;
}
return power;
}
int main()
{
while(cin>>n && n)
{
for(int i=0;i<n;i++)
scanf("%s",str[i]);
for(int i=1;i<n;i++)
for(int j=0;j<i;j++)
dist[i][j]=dist[j][i]=weight(i,j);
cout<<"The highest possible quality is 1/"<<prim()<<'.'<<endl;
}
return 0;
}