POJ 1789 Truck History (prime_裸题)
2015-08-17 12:44
381 查看
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
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.
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.
where 1/Q is the quality of the best derivation plan.
prime算法裸题,直接上码,
题目意思可能有点难度,其实就是各个字符串直接不同的字母加+1就好,就等于距离,譬如aaa,abc,第二位跟第三位不同,距离就为2;
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
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 Specification
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 Specification
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.prime算法裸题,直接上码,
题目意思可能有点难度,其实就是各个字符串直接不同的字母加+1就好,就等于距离,譬如aaa,abc,第二位跟第三位不同,距离就为2;
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int inf=99999999; int map[2020][2020],lowcost[2020],vis[2020]; char a[2020][9]; int main() { int n,i,j,m,k,sum,w; while(scanf("%d",&n)==1 && n){ for(i=1;i<=n;i++) { scanf("%s",&a[i]); vis[i]=0; } for(i=1;i<=n;i++) { for(j=i+1;j<=n;j++) { w=0; for(k=0;k<7;k++) { if(a[i][k]!=a[j][k]) w++; } map[i][j]=map[j][i]=w; } } vis[1]=1; for(i=1;i<=n;i++) { lowcost[i]=map[1][i]; } sum=0; for(i=1;i<=n;i++) { int temp=inf; for(j=1;j<=n;j++) { if(!vis[j]&&lowcost[j]<temp) { k=j; temp=lowcost[j]; } } if(temp==inf) break; sum+=temp; vis[k]=1; for(j=1;j<=n;j++) { if(!vis[j]&& lowcost[j]>map[k][j]) lowcost[j]=map[k][j]; } } printf("The highest possible quality is 1/%d.\n",sum); } return 0; }
相关文章推荐
- 黑马程序员——Map集合的基本概述
- 新秀学习Hibernate——一个简单的例子
- HDU 1018-Big Number(数学)
- 前端mock数据之mockjax和mockjson
- 浅析js中不同的height, top对比
- 关于通过异或交换两个元素的值的一个陷阱
- [推荐系统]mahout支持的对推荐引擎的评价方法
- PHP获取表单方法
- C# Dictionary增加的方法
- [LeetCode] Best Time to Buy and Sell Stock
- openwrt libubox 开发简介
- 介绍Python 和 Scikit-Learn 的机器学习
- 【Thinking in Java笔记】怎么使用protected关键字
- 对程序员的建议
- iOS中RunLoop机制浅探
- ubuntu下总提示认证失败怎么办
- 【翻译】配置RSVP-signaled LSP
- html加载视频文件的方法
- Spring学习笔记(六):Rest的使用
- CodeForces 379F 树的直径 New Year Tree