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
本题是最小生成树模板题, 由于给出的是每个点的坐标, 所以可以先求出每个点之间的距离存入map数组,再用prim算法即可, 题目的卫星信道数量只要在找到最小树排序所有距离后的减掉最大的几个距离即可,最后输出目前最大的距离就是最小D。
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
double map[10010][10010];
double book[10010], dis[10010], numx[10010], numy[10010];
int main()
{
int n;
int i, j, k;
scanf("%d",&n);
while(n--)
{
memset(book,0,sizeof(book));
int s, p, x, y;
scanf("%d%d",&s,&p);
for(i=1; i<=p; i++)
scanf("%lf%lf",&numx[i],&numy[i]);
for(i=1; i<=p; i++)
for(j=1; j<=p; j++)
{
map[i][j]=sqrt((numx[i]-numx[j])*(numx[i]-numx[j])+(numy[i]-numy[j])*(numy[i]-numy[j]));//将各个点之间的距离存入map数组
}
for(i=1; i<=p; i++)
dis[i]=map[1][i];
book[1]=1;
int count=1;
while(count<p)
{
int min=9999999;
for(i=1; i<=p; i++)
{
if(book[i]==0&&dis[i]<min)
{
min=dis[i];
k=i;
}
}
count++, book[k]=1;
for(i=1; i<=p; i++)
{
if(book[i]==0&&dis[i]>map[i][k])
dis[i]=map[i][k];
}
}
sort(dis+1,dis+p+1);//排序所有最短的距离
printf("%.2lf\n",dis[p-s+1]);
}
}