ZOJ-1942

给出n个点，包括起点和终点，求一条通路使得这条路上的最大两点距离是所有路的最大两点距离最小的路，然后求出这个最大距离。。我是用类似Kruskal的并查集来做的，从最小的边开始加入，直到起点和终点连通

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

struct JumpStruct
{
	int a;
	int b;
	int d;
};

struct StoneStruct
{
	struct StoneStruct *parent;
	int rank;
};

typedef struct StoneStruct *Stone;

static Stone make_set()
{
	Stone s = malloc(sizeof(struct StoneStruct));
	s->parent = s;
	s->rank = 1;
	return s;
}

static Stone find_set(Stone s)
{
	if (s->parent != s)
		s->parent = find_set(s->parent);
	return s->parent;
}

static void link(Stone s1, Stone s2)
{
	if (s1->rank > s2->rank)
		s2->parent = s1;
	else
	{
		s1->parent = s2;
		if (s1->rank == s2->rank)
			s2->rank++;
	}
}

static void union_set(Stone s1, Stone s2)
{
	link(find_set(s1), find_set(s2));
}

static int cmp(const void *p1, const void *p2)
{
	struct JumpStruct *j1 = (struct JumpStruct*) p1;
	struct JumpStruct *j2 = (struct JumpStruct*) p2;
	return j1->d - j2->d;
}

int main()
{
	int n, i, j, x[200], y[200];
	struct JumpStruct *edges = malloc(20000 * sizeof(struct JumpStruct));
	Stone *stones = malloc(200 * sizeof(Stone));
	int count = 0;
	while (scanf("%d", &n), n)
	{
		printf("Scenario #%d\n", ++count);
		for (i = 0; i < n; i++)
			scanf("%d %d", &x[i], &y[i]);
		int total = 0;
		for (i = 0; i < n; i++)
			for (j = i + 1; j < n; j++)
			{
				edges[total].a = i;
				edges[total].b = j;
				edges[total].d = (x[i] - x[j]) * (x[i] - x[j])
						+ (y[i] - y[j]) * (y[i] - y[j]);
				total++;
			}
		qsort(edges, total, sizeof(struct JumpStruct), cmp);

		stones[0] = make_set();
		stones[1] = make_set();
		for (i = 0; i < total; i++)
		{
			int a = edges[i].a;
			int b = edges[i].b;
			if (stones[a] == NULL)
				stones[a] = make_set();
			if (stones[b] == NULL)
				stones[b] = make_set();
			Stone s1 = find_set(stones[a]);
			Stone s2 = find_set(stones[b]);
			if (s1 != s2)
				union_set(s1, s2);
			if (find_set(stones[0]) == find_set(stones[1]))
			{
				printf("Frog Distance = %.3lf\n\n", sqrt(1.0 * edges[i].d));
				break;
			}
		}
		for (i = 0; i < n; i++)
		{
			if (stones[i] != NULL)
				free(stones[i]);
			stones[i] = NULL;
		}
	}
	free(stones);
	free(edges);
	return 0;
}