九度oj 1144

题目描述：

    In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley's engagement falls through. 
    Consider Dick's back to be a plane with freckles at various (x,y) locations. Your job is to tell Richie how to connect the dots so as to minimize the amount of ink used. Richie connects the dots by drawing straight lines between pairs, possibly lifting the pen between lines. When Richie is done there must be a sequence of connected lines from any freckle to any other freckle. 

输入：

    The first line contains 0 < n <= 100, the number of freckles on Dick's back. For each freckle, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the freckle.

输出：

    Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the freckles.

样例输入：

31.0 1.02.0 2.02.0 4.0

样例输出：

3.41

来源：

2009年北京大学计算机研究生机试真题

#include<iostream>#include<stdio.h>#include<algorithm>#include<math.h>#include<string.h>using namespace std;#define N 101int tree[N];int findroot(int x){    if(tree[x]==-1)    return x;    else    return findroot(tree[x]);}struct edge{       int a,b;       double cost;       bool operator<(const edge &a)const       {            return cost<a.cost;            }            }edge[6000];            struct point{                   double x,y;                   double getdistance(point a)                   {                          double tmp=(x-a.x)*(x-a.x)+(y-a.y)*(y-a.y);                          return sqrt(tmp);                           }                          }list[101];                          int main()                          {                              int n;                              while(cin>>n)                              {                                           for(int i=1;i<=n;i++)                                           {                                                   scanf("%lf%lf",&list[i].x,&list[i].y);                                                   }                                                   memset(tree,-1,sizeof(tree));                                                   int size=0;                                                   for(int i=1;i<=n;i++)                                                   {                                                           for(int j=i+1;j<=n;j++)                                                           {                                                           edge[size].a=i;                                                           edge[size].b=j;                                                           edge[size].cost=list[i].getdistance(list[j]);                                                           size++;                                                           }                                                           }                                                           sort(edge,edge+size);                                                           double ans=0;                                                           for(int i=0;i<size;i++)                                                           {                                                                   int a=findroot(edge[i].a);                                                                   int b=findroot(edge[i].b);                                                                   if(a!=b)                                                                   {                                                                           tree[a]=b;                                                                           ans+=edge[i].cost;                                                                           }                                                                           }                                                                           printf("%.2lf\n",ans);                                                                           }                                                                           }