【2017/2/25】
题目:http://ac.jobdu.com/problem.php?pid=1144
题意:平面上有若干个点,用线段将这些点连接起来,使任意两个点能够通过一系列线段相连,给出所有点的坐标,求一种连接方式使所有线段的长度最小,求长度和
思路:题目本身就是Kruskal算法找最小生成树,没什么难度;重点在于数据的转化处理。需要把原始的坐标信息,转化为点的编号。
#include<cstdio>
#include<algorithm>
#include<cmath>
#define maxSize 10005
using namespace std;
struct Point {//点
double x, y;
int id; //点的编号
}point[105];
struct Road {
double len;
int a_id, b_id; //左右端点编号
}road[maxSize];
int tree[105];
bool cmp(Road A, Road B) {
return A.len < B.len;
}
int findRoot(int x) {//寻根
if (-1 == tree[x]) return x;
else {
int temp = findRoot(tree[x]);
tree[x] = temp; //路径压缩
return temp;
}
}
void getRoad(int n) { //数据处理
int num = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i >= j) continue; //注意:(i,j)与(j,i)是同一点
double xlen = abs(point[i].x - point[j].x);
double ylen = abs(point[i].y - point[j].y);
double len = sqrt(xlen * xlen + ylen * ylen);
//两点间的距离
road[num].a_id = point[i].id; //给边的端点编号
road[num].b_id = point[j].id;
road[num++].len = len; //边长
}
}
}
int main() {
int n;
while (scanf("%d", &n) != EOF) {
int maxN = n * (n - 1) / 2;//总边数
for (int i = 1; i <= maxN; i++) {//初始化
tree[i] = -1;
}
for (int i = 1; i <= n; i++) {
scanf("%lf%lf", &point[i].x, &point[i].y);
point[i].id = i; //给点编号
}
getRoad(n); //数据处理
sort(road + 1, road + maxN + 1, cmp);//按长度递减排序
double sum = 0;
for (int i = 1; i <= maxN; i++) {//遍历所有边
int a = findRoot(road[i].a_id);
int b = findRoot(road[i].b_id);
if (a != b) {
tree[a] = b;
sum += road[i].len;
}
}
/*
int MST = 0; //判断是否为最小生成树
for (int i = 1; i <= maxN; i++) {
if (-1 == tree[i])
MST++; //若最后MST=1,则成功
}
*/
printf("%.2lf\n", sum);
}
return 0;
}