POJ - 2349 Arctic Network（kruscal）

题目：

The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and some outposts will in addition have a satellite channel. 
Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers. Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts. 

Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts.

Input

The first line of input contains N, the number of test cases. The first line of each test case contains 1 <= S <= 100, the number of satellite channels, and S < P <= 500, the number of outposts. P lines follow, giving the (x,y) coordinates of each outpost in km (coordinates are integers between 0 and 10,000).

Output

For each case, output should consist of a single line giving the minimum D required to connect the network. Output should be specified to 2 decimal points.

Sample Input

1
2 4
0 100
0 300
0 600
150 750

Sample Output

212.13

中文题意：

国防部（DND）要用无线网络连接北部几个哨所。两种不同的通信技术被用于建立网络：每一个哨所有一个无线电收发器，一些哨所将有一个卫星频道。

任何两个有卫星信道的哨所可以通过卫星进行通信，而不管他们的位置。同时，当两个哨所之间的距离不超过D时可以通过无线电通讯，D取决于对收发器的功率。功率越大，D也越大，但成本更高。出于采购和维修的方便，所有哨所的收发器必须是相同的；那就是说，D值对每一个哨所相同。

你的任务是确定收发器的D的最小值。每对哨所间至少要有一条通信线路（直接或间接）。

分析：这道题目显然是最小生成树的题目，不难想到，最优解中一定用上了所有的卫星进行通信，s个卫星可以连接s个点，所以我们的最优解就是按照kruscal算法求最小生成树时所要连接的第p-s条边，分析到这，这道题目基本上就能够解决了，下面是代码:

#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<map>
#include<cmath>
#include<queue>
using namespace std;
const int N=503;
double x[N],y[N];
int n,s,p,fu[N];
struct node{
	int x,y;
	double dis;
}q[200000]; 
double dis(int i,int j)
{
	return sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
}
bool cmp(node a,node b)
{
	return a.dis<b.dis;
}
int find(int x)
{
	if(fu[x]!=x) fu[x]=find(fu[x]);
	return fu[x];
}
int main()
{
	cin>>n;
	while(n--)
	{
		scanf("%d%d",&s,&p);
		for(int i=1;i<=p;i++)
			scanf("%lf%lf",&x[i],&y[i]);
		for(int i=1;i<=p;i++) fu[i]=i;
		int cnt=0;
		for(int i=1;i<p;i++)
		for(int j=i+1;j<=p;j++)
			q[++cnt]={i,j,dis(i,j)};
		sort(q+1,q+cnt+1,cmp);
		int count=0;
		for(int i=1;i<=cnt;i++)
		{
			int f1=find(q[i].x),f2=find(q[i].y);
			if(f1==f2) continue;
			fu[f1]=f2;
			count++;
			if(count==p-s)
			{
				printf("%.2f\n",q[i].dis);
				break;
			}
		}
	}
	return 0;
}