Poj(2349)，最小生成树的变形

题目链接：http://poj.org/problem?id=2349

Arctic Network

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 17032		Accepted: 5441

Description

The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and some outposts will in addition have a satellite channel. 
Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers. Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts.

Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts.

Input

The first line of input contains N, the number of test cases. The first line of each test case contains 1 <= S <= 100, the number of satellite channels, and S < P <= 500, the number of outposts. P lines follow, giving the (x,y) coordinates of each outpost in km (coordinates are integers between 0 and 10,000).

Output

For each case, output should consist of a single line giving the minimum D required to connect the network. Output should be specified to 2 decimal points.

Sample Input

1
2 4
0 100
0 300
0 600
150 750

Sample Output

212.13

Source

Waterloo local 2002.09.28

 

题意：1案例数，2个点是可以用无线的(用无线的点，到任何点的距离不受限制)，4个点，下面是坐标，求最小生成树中的最大权值，和之前的不同点是在权值为0的点是不确定的。

思路：照样求最小生成树，有2个点的距离为0，即可以在最小生成树中删掉两条最长的边。最靠后的那条边就是最大的权值。

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>

using namespace std;

int x[];
int y[];

struct Edge {
    int u,v;
    double w;
}edge[*];

int father[];

int Find_Set(int x)
{
    if(x!=father[x])
        father[x] = Find_Set(father[x]);
    return father[x];
}

int cmp (Edge a,Edge b)
{
    return a.w < b.w;
}

double ans[];

int main()
{
    //freopen("input.txt","r",stdin);
    int cases;
    scanf("%d",&cases);
    while(cases--)
    {
        memset(ans,,sizeof(ans));
        int s,n;
        scanf("%d%d",&s,&n);
        for(int i=;i<n;i++)
           scanf("%d%d",&x[i],&y[i]);

        int cnt = ;
        for(int i=;i<n;i++)
            for(int j=;j<i;j++)
            {
                edge[cnt].u = i;
                edge[cnt].v = j;
                edge[cnt++].w = sqrt(1.0*(x[i]-x[j])*(x[i]-x[j])+1.0*(y[i]-y[j])*(y[i]-y[j]));
            }

        for(int i=;i<=n;i++)
            father[i] = i;

        sort(edge,edge+cnt,cmp);

        int k=;
        for(int i=;i<cnt;i++)
        {
            int fx = Find_Set(edge[i].u);
            int fy = Find_Set(edge[i].v);
            if(fx!=fy)
            {
                father[fy] = fx;
                ans[k]=edge[i].w;
                k++;
                if(k==n-)
                    break;
            }
        }
        printf("%.2lf\n",ans[n-s-]);
    }
    return ;
}