POJ 1789 Truck History
来源:互联网 发布:农村淘宝合伙人加盟 编辑:程序博客网 时间:2024/06/16 22:18
Truck History
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 29412 Accepted: 11510
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<cstdio>#include<cstring>#include<iostream>#include<algorithm>#define MAX 10000000using namespace std;char str[2001][7];int ans[2001][2001];void kruskal(int ans[][2001],int n){ int k[2001];//数组大小要确定,否则CE。 int min,flag,sum=0; for(int i=0;i<n;i++) k[i]=ans[0][i]; for(int i=1;i<n;i++) {//循环n-1遍即可搜索完全部数据,否则sum会多加一遍max。 min=MAX; for(int j=0;j<n;j++) {//搜索边最小 if(k[j]<min&&k[j]!=0) { min=k[j]; flag=j; } } sum+=min; k[flag]=0; for(int j=0;j<n;j++) {//搜索flag边里的最小放到边里。 if(ans[flag][j]<k[j]&&k[j]!=0) k[j]=ans[flag][j]; } } printf("The highest possible quality is 1/%d.\n",sum);}int main(){ int n,num; while(scanf("%d",&n)!=EOF&&n!=0) { memset(str,0,sizeof(str)); memset(ans,0,sizeof(ans)); for(int i=0;i<n;i++) { scanf("%s",str[i]); for(int j=0;j<=i;j++) {//输入并与之前输入的做比较 num=0; for(int k=0;k<7;k++) { if(str[i][k]!=str[j][k]) num++; } ans[i][j]=ans[j][i]=num; } } kruskal(ans,n); } return 0;}
阅读全文
0 0
- POJ 1789 Truck History
- POJ 1789 Truck History
- POJ 1789 Truck History
- poj 1789 Truck History
- poj 1789 Truck History
- Poj 1789 Truck History
- poj 1789 Truck History
- poj 1789 Truck History
- poj 1789 Truck History
- poj 1789 Truck History
- POJ-1789-Truck History
- poj-1789-Truck History
- POJ 1789 Truck History
- poj 1789 Truck History
- POJ 1789 Truck History
- POJ 1789 Truck History
- POJ 1789 Truck History
- POJ 1789 Truck History
- 简单数组排序
- SpingMvc的讲解
- 外键约束 以及 数据库中实体的对应关系(1==1,1==n,n==n)
- 【数据结构和算法】Day 13
- Expected response code 220 but got code “”, with message “””
- POJ 1789 Truck History
- 多维动态规划——洛谷P1006 传纸条
- tensorflow笔记(四)之MNIST手写识别系列一
- python入门
- ASP.NET Core
- 设计模式的应用场景(6)--外观模式
- 11.C++调用Lua全局变量(表)
- stream_socket_enable_crypto(): this stream does not
- Number Sequence