zoukankan      html  css  js  c++  java
  • Freckles

    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

    prim:

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<queue>
    #include<cmath>
    using namespace std;
    int n;
    double map[110][110],sum;
    int v[210];
    void prm()
    {
        int i,k,p;
        double max;
        k=n-1;
        while (k--)
        {
            for (i=2;i<=n;i++)
            if (!v[i]) {max=map[1][i];p=i;break;}
            for (i=i+1;i<=n;i++)
            if (!v[i]&&max>map[1][i]) {max=map[1][i];p=i;}
            v[p]=1;
            sum+=max;
            for (i=2;i<=n;i++)
            if (map[1][i]>map[p][i]) map[1][i]=map[p][i];
        }
        return ;
    }
    int main()
    {
        double a[110],b[110];
        int i,j;
        sum=0;
        scanf("%d",&n);
        for (i=1;i<=n;i++) scanf("%lf%lf",&a[i],&b[i]);
        for (i=1;i<=n;i++)
        for (j=i;j<=n;j++)
        map[i][j]=map[j][i]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
        prm();
        printf("%0.2f
    ",sum);
        return 0;
    }
    
  • 相关阅读:
    我们是如何实现DevOps的
    cmp命令
    全排列II
    chown命令
    两个数组的交集II
    MVVM模式的理解
    chmod命令
    路径总和
    cat命令
    跳水板
  • 原文地址:https://www.cnblogs.com/pblr/p/4711409.html
Copyright © 2011-2022 走看看