hdu 1162 prim模板

#include<stdio.h>
#include<math.h>
#include<cstring>
int n;
#define INF 99999999 
struct edge
{
    double x,y;
}e[300];
double map[300][300],dis[300],book[300];
double absp(double x)                                  //名字换成abs，hdu c++就报错了
{
    return x>0?x:-x;
}
double D(double x1,double y1,double x2,double y2)
{
    double s;
    double x=absp(x1-x2);
    double y=absp(y1-y2);
    s=x*x+y*y;
    return sqrt(s);
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%lf%lf",&e[i].x,&e[i].y);
        }
        memset(map,INF,sizeof(map));
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                map[i][j]=map[j][i]=D(e[i].x,e[i].y,e[j].x,e[j].y);
            }
        }
        for(int i=1;i<=n;i++)
        {
            dis[i]=map[1][i];
            book[i]=0;
        }
        book[1]=1;
        double sum=0;
        for(int q=1;q<n;q++)                                  //prim算法关键！！
        {
            int k=-1;
            double min=INF;
            for(int i=1;i<=n;i++)
            {
                if(book[i]==0&&dis[i]<min)
                {
                    min=dis[i];
                    k=i;
                }
            }
            book[k]=1;
            sum+=min;
            for(int i=1;i<=n;i++)
            {
                if(book[i]==0&&dis[i]>map[k][i])
                    dis[i]=map[k][i];
            }
        }
        printf("%.2lf\n",sum);
    }
    return 0;
}