freckles

题目描述：

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.

样例输入：

3
1.0 1.0
2.0 2.0
2.0 4.0

样例输出：

3.41

这道题就是输入n，和n个坐标

然后输出将所有点连起来的最短路径

还是最小生成树

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
int path[];

struct edge{
    int a,b;
    double cost;
    bool operator <(const edge &A) const{
        return cost<A.cost;
    }
}edge[];

int findroot(int a){
    int temp=a;
    while (path[a] != -){
        a=path[a];
    }
    int temp2;

    while (path[temp]!= -){
        temp2=path[temp];
        path[temp]=a;
        temp=temp2;
    }
    return a;
}

int main (){
    int n;
    double point[][];
    while (cin>>n){
        int size=;
        for (int i=;i<=n;i++){
            cin>>point[i][]>>point[i][];
            for (int j=;j<i;j++){
                edge[size].a=i;
                edge[size].b=j;
                edge[size].cost=sqrt(pow(point[i][]-point[j][],2.0)+pow(point[i][]-point[j][],2.0));
                size++;
            }
        }

        int nn=n*(n-)/;
        for (int i=;i<=n;i++){
            path[i]=-;
        }
        double ans=;

        sort(edge+,edge++nn);
        int a,b;
        for (int i=;i<=nn;i++){
            a=edge[i].a;
            b=edge[i].b;
            a=findroot(a);
            b=findroot(b);
            if (a!=b){
                path[a]=b;
                ans += edge[i].cost;
            }
        }

        printf("%.2lf\n",ans);//输出精确到两位小数
    }
    return ;

}
//图论的edge什么的下标都是从1开始的，而不是0比较方便 

学会了输出两位小数怎么做