POJ_1789(Prim算法)
来源:互联网 发布:淘宝欧美风店铺 编辑:程序博客网 时间:2024/05/21 07:50
Truck History
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14308 Accepted: 5461
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 to is the original type and td the type derived from it and d(to,td) 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 to is the original type and td the type derived from it and d(to,td) 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
4aaaaaaabaaaaaaabaaaaaaabaaaa0
Sample Output
The highest possible quality is 1/3.
每个字符串相当于一个点,任意两点之间距离即为两个字符串对应位置字符不一样的个数。
#include <stdio.h>#include<string.h>const int INF = 999999;int length[2001][2001];int sum,n;int visit[2001];int lowcost[2001];void prim(){int i,j,u;memset(visit,false,sizeof(visit));for(i=1;i<=n;i++)lowcost[i]=length[1][i];visit[1]=true;for(i=1;i<=n;i++){int temp = INF;for(j=1;j<=n;j++){if(!visit[j]&&lowcost[j]<temp){u = j;temp = lowcost[j];}}if(temp==INF)break;sum+=temp;visit[u]=true;for(j=1;j<=n;j++){if(!visit[j]&&lowcost[j]>length[u][j])lowcost[j]=length[u][j];}}}int main(){int i,j,t;char buf[2001][7] ;//FILE *fp = freopen("data.txt","r",stdin);while(scanf("%d",&n)!=EOF){if(n==0)break;memset(length,INF,sizeof(length)); for(i=1;i<=n;i++){scanf("%s",buf[i]);}for(i=1;i<=n;i++)for(j=1;j<i;j++){int t,count=0;for(t=0;t<7;t++)if(buf[i][t]!=buf[j][t])count++;length[i][j]=length[j][i]=count;}sum=0;prim();printf("The highest possible quality is 1/%d.\n",sum);}return 0;}
- POJ_1789(Prim算法)
- poj_1789 Prim算法应用
- POJ_1789(Truck History )(最小生成树(普里姆prim算法))
- poj_1789 Truck History(prim)
- poj_1789
- poj_1789
- Prim算法 (改进)
- hdu1863(prim算法)
- 普里姆(Prim)算法
- poj_1258(Prim算法)
- POJ_2485(Prim算法)
- 普利姆(Prim)算法
- prim算法(poj1789)
- 普里姆算法(Prim)
- 普里姆(prim)算法
- 普里姆(Prim)算法
- prim算法(普里姆算法)
- Prim算法(普里姆算法)
- ASP.NET弹出对话框几种基本方法 和 页面跳转
- iOS 新浪微博客户端Demo实践之(三)微博主页
- 如何设置source insight正确显示日文?
- 模型导入问题解析【unity3d教程】
- MFC XP风格
- POJ_1789(Prim算法)
- C++中的单例模式——设计模式
- sql server 2005 属性IsLocked不可用于登录"[sa]
- Python的静态方法和类成员方法
- Date类、Calendar类和DateFormate类
- timeout expired.then timeout period elapsed prior to obtaining a connection from the pool.……
- php的$_FILES的临时储存文件与"回收机制"
- top 带时间戳
- web.xml中load-on-startup的作用