最小生成树练习

原创 2018年04月17日 13:43:14

POJ 1789 Truck History

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.

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.

用Kruskal算法做,注意数组长度 边要是点的两倍

#include<stdio.h>
#include<iostream>
#include<algorithm>
#define MAX 2000*2000+1
using namespace std;
char s[2001][2001];
int n;
int m;
int tree[MAX];
struct Edge {
	int a;
	int b;
	int cost;
}edge[MAX];
bool cmp(Edge a, Edge b) {
	return a.cost < b.cost;
}
void getmap() {
	int i, j, k;
	for (i = 0; i < n; i++) {
		for (j = i + 1; j < n; j++) {
			int cnt = 0;
			for (k = 0; k < 7; k++) {
				if (s[i][k] != s[j][k]) {
					cnt++;
				}
			}
			edge[m].cost = cnt;
			edge[m].a = i;
			edge[m].b = j;
			m++;
		}
	}
}
int findroot(int a) {
	if (tree[a] == -1) return a;
	else {
		int t = findroot(tree[a]);
		tree[a] = t;
		return t;
	}
}
int kruskal() {
	int i, j;
	int ans=0;
	for (i = 0; i < MAX; i++) {
		tree[i] = -1;
	}
	for (i = 0; i < m; i++) {
		int a = findroot(edge[i].a);
		int b = findroot(edge[i].b);
		if (a != b) {
			tree[a] = b;
			ans += edge[i].cost;
		}
	}
	return ans;
}
int main() {
	while (scanf("%d", &n) != EOF) {
		if (n == 0) break;
		int i, j;
		for (i = 0; i < n; i++) {
			scanf("%s", s[i]);
		}
		m = 0; //代表边的数量
		getmap();
		sort(edge, edge + m, cmp);
		int min=kruskal();
		printf("The highest possible quality is 1/%d.\n", min);
	}
}

最小生成树

  • 2016年08月18日 13:36
  • 1.28MB
  • 下载

最小生成树 Prime算法 简单题

相比于Kruskal算法,Prime算法是以顶点
  • u011699990
  • u011699990
  • 2014-09-23 18:15:15
  • 1604

SUDT 2144 图结构练习——最小生成树

点击打开题目链接 #include #define INF 0x3f3f3f3f using namespace std; int Graph[10010][10010]; bool vis[10...
  • zhidetian
  • zhidetian
  • 2016-08-05 15:25:42
  • 144

图结构练习——最小生成树-prim

题目描述  有n个城市,其中有些城市之间可以修建公路,修建不同的公路费用是不同的。现在我们想知道,最少花多少钱修公路可以将所有的城市连在一起,使在任意一城市出发,可以到达其他任意的城市。   输入 ...
  • RIPwangh
  • RIPwangh
  • 2015-06-15 21:10:51
  • 602

《算法导论》笔记(15) 最小生成树 部分习题

习题23.1-11 给定图G和一棵最小生成树T,假设减少了位于T之外的某条边的权重。因为T内的边,是连接所有结点的权重最小的,那么首先将T外的减少权重的边(u, v)加入T,然后在u, v中寻找所有的...
  • nklofy
  • nklofy
  • 2015-02-19 01:48:01
  • 2589

最小生成树最小生成树最小生成树最小生成树

  • 2009年12月06日 14:20
  • 468KB
  • 下载

最小生成树最小生成树最小生成树最小生成树最小生成树

  • 2010年06月26日 16:13
  • 2KB
  • 下载

C#实现最小生成树

  • 2015年01月07日 11:46
  • 65KB
  • 下载

最小生成树解决tsp问题

  • 2014年04月06日 15:55
  • 894KB
  • 下载

bzoj 2521: [Shoi2010]最小生成树(最小割)

2521: [Shoi2010]最小生成树 Time Limit: 10 Sec  Memory Limit: 128 MB Submit: 422  Solved: 246 [Submit][...
  • clover_hxy
  • clover_hxy
  • 2016-08-14 19:43:45
  • 345
收藏助手
不良信息举报
您举报文章:最小生成树练习
举报原因:
原因补充:

(最多只允许输入30个字)