2560 Freckles

最新推荐文章于 2017-07-25 15:14:00 发布

kongming_acm

最新推荐文章于 2017-07-25 15:14:00 发布

阅读量641

点赞数

分类专栏： acm_图论文章标签： ini numbers each output input

本文链接：https://blog.csdn.net/kongming_acm/article/details/5728788

版权

acm_图论专栏收录该内容

71 篇文章 0 订阅

订阅专栏

Freckles

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3615		Accepted: 1924

Description

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.

Input

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.

Output

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

Sample Input

3
1.0 1.0
2.0 2.0
2.0 4.0

Sample Output

3.41

#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
double dis(double x1,double y1,double x2,double y2)
{
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
int main()
{
    int n;
    while(scanf("%d",&n)==1)
    {
        double a[110][110];
        memset(a,10,sizeof(a));
        double x[110],y[110];
        for(int i=0;i<n;i++) scanf("%lf%lf",&x[i],&y[i]);
        for(int i=0;i<n;i++) for(int j=0;j<n;j++) a[i][j]=dis(x[i],y[i],x[j],y[j]);
        //.........................
        int vis[110];double lowc[110];
        int p;
        double minc,res=0;
        const int inf=(1<<30);
        memset(vis,0,sizeof(vis));
        vis[0]=1;
        for(int i=0;i<n;i++) lowc[i]=a[0][i];
        int flag=0;
        for(int l=1;l<n;l++)
        {
            minc=inf;p=0;
            for(int i=0;i<n;i++)
            {
                if(vis[i]==0&&minc>lowc[i])
                {
                    minc=lowc[i];
                    p=i;
                }
            }
            if (inf == minc) {flag=1; break;}      // ԭͼ����ͨ
            vis[p]=1;res+=minc;
            for(int i=0;i<n;i++)
            {
                if(vis[i]==0&&lowc[i]>a[p][i]) lowc[i]=a[p][i];
            }
        }
        //...............
        printf("%.2lf/n",res);
    }
    return 0;
}