POJ-2349-Arctic Network [最小生成树]

---

题目传送门

---

题意:
军事基地需要建立通信，有两种通信方式，无线电通信和卫星通信，无线通信有距离限制，卫星通信无视距离，只有S个基地可以建立卫星通信，求最长的建立无线通信的距离
思路:
用Kruskal最小生成树，每次合并两个基地，加一条边，当边数+S为总基地数时，即为需要建立最长的无线通信的距离

#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <map>
#include <set>

using namespace std;

int S, N, fa[600];
struct node{
    int x, y;
}point[600];
struct node2{
    int x, y;
    double d;
}P[600*300];
bool cmp(node2 a, node2 b)
{
    return a.d<=b.d;
}
void init()
{
    for (int i = 1; i <= 600; i++)
        fa[i] = i;
    return;
}
int find(int x)
{
    while (x!=fa[x]) x = fa[x];
    return x;
}
double Dis(int a, int b)
{
    double px = 1.0*(point[a].x-point[b].x);
    double py = 1.0*(point[a].y-point[b].y);
    return sqrt(px*px+py*py);
}
int main(void)
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

    int T;
    scanf("%d", &T);
    while (T--)
    {
        init();
        scanf("%d %d", &S, &N);
        for (int i = 1; i <= N; i++)
            scanf("%d %d", &point[i].x, &point[i].y);
        int num = 0;
        for (int i = 1; i < N; i++)
        {
            for (int j = 1+i; j <= N; j++)
            {
                P[num].x = i;
                P[num].y = j;
                P[num].d = Dis(i, j);
                num++;
            }
        }
        sort(P, P+num, cmp);
        double ans = 0;
        int l=0;
        for (int i = 0; i < num; i++)
        {
            if (find(P[i].x) != find(P[i].y))
            {
                int a = find(P[i].x);
                int b = find(P[i].y);
                fa[a] = b;
                l++;
                if (S+l==N)
                    ans = P[i].d;
            }
        }
        printf("%.2f\n", ans);
    }
    return 0;
}