POJ 2349

【题目分析】
最小生成树

---

【代码】

#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
double x[501],y[501],w[5000001];
int s,p,tt;
int fr[5000001],to[5000001],f[501],en=1,rank[5000001];
inline int gf(int k)
{if (f[k]==k) return k;else return f[k]=gf(f[k]);}
inline double dis(double x1,double y1,double x2,double y2)
{return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
inline bool cmp(int a,int b)
{return w[a]<w[b];}
int main()
{
    scanf("%d",&tt);
    while (tt--)
    {
        en=1;
        scanf("%d%d",&s,&p);
        for (int i=1;i<=p;++i)
            scanf("%lf%lf",&x[i],&y[i]),f[i]=i;
        for (int i=1;i<p;++i)
            for (int j=i+1;j<=p;++j){
                fr[en]=i;to[en]=j;
                w[en]=dis(x[i],y[i],x[j],y[j]);
                en++;
        }
        for (int i=1;i<=p;++i) f[i]=i;
        for (int i=1;i<en;++i) rank[i]=i;
        sort(rank+1,rank+en,cmp);
        int cnt=0;double ans=0;
        for (int i=1;i<en;++i)
        {
            int l=fr[rank[i]],r=to[rank[i]];
            int fl=gf(l),fr=gf(r);
            if (fl!=fr)
            {
                f[fl]=fr;
                ans=w[rank[i]];
                cnt++;
                if (cnt==p-s) break;
            }
        }
        printf("%.2f\n",ans);
    }
}