POJ 1751

【题目分析】
卡空间的最小生成树，只能用Prim

---

【代码】

#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
double x[751],y[751];
int n,m;
double dis[751][751],f[751];
int pre[751],in[751];
inline void prim()
{
    in[1]=1;
    for (int i=2;i<=n;++i) f[i]=dis[1][i],pre[i]=1;
    f[1]=0;
    double minn=0x3f3f3f3f;int p=0;
    for (int i=1;i<=n;++i)
    {
        minn=0x3f3f3f3f;p=1;
        for (int j=1;j<=n;++j)
            if (!in[j]&&f[j]<minn)
            {
                p=j;
                minn=f[j];
            }
        in[p]=1;
        for (int j=1;j<=n;++j)
        {
            if (f[j]>dis[p][j]&&!in[j])
            {
                f[j]=dis[p][j];
                pre[j]=p;
            }
        }
    }
    for (int i=2;i<=n;++i)
    if (dis[pre[i]][i]){
        printf("%d %d\n",pre[i],i);
    }
}
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;++i)
        scanf("%lf%lf",&x[i],&y[i]);
    for (int i=1;i<n;++i)
        for (int j=i+1;j<=n;++j)
            dis[i][j]=dis[j][i]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
    scanf("%d",&m);
    for (int i=1;i<=m;++i)
    {
        int l,r;
        scanf("%d%d",&l,&r);
        dis[l][r]=dis[r][l]=0;
    }
    prim();
}