并查集+二分（POJ 2253）

Description

Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen, he wants to avoid swimming and instead reach her by jumping. 
Unfortunately Fiona's stone is out of his jump range. Therefore Freddy considers to use other stones as intermediate stops and reach her by a sequence of several small jumps. 
To execute a given sequence of jumps, a frog's jump range obviously must be at least as long as the longest jump occuring in the sequence. 
The frog distance (humans also call it minimax distance) between two stones therefore is defined as the minimum necessary jump range over all possible paths between the two stones. 

You are given the coordinates of Freddy's stone, Fiona's stone and all other stones in the lake. Your job is to compute the frog distance between Freddy's and Fiona's stone. 

Input

The input will contain one or more test cases. The first line of each test case will contain the number of stones n (2<=n<=200). The next n lines each contain two integers xi,yi (0 <= xi,yi <= 1000) representing the coordinates of stone #i. Stone #1 is Freddy's stone, stone #2 is Fiona's stone, the other n-2 stones are unoccupied. There's a blank line following each test case. Input is terminated by a value of zero (0) for n.

Output

For each test case, print a line saying "Scenario #x" and a line saying "Frog Distance = y" where x is replaced by the test case number (they are numbered from 1) and y is replaced by the appropriate real number, printed to three decimals. Put a blank line after each test case, even after the last one.

Sample Input

2
0 0
3 4

3
17 4
19 4
18 5

0

Sample Output

Scenario #1
Frog Distance = 5.000

Scenario #2
Frog Distance = 1.414

题意:

        给你N个石头的坐标(x,y)，现在青蛙要从第一个石头跳到第二个石头上去(青蛙可以通过跳跃到其他石头而间接到达第2个石头上)，但是青蛙每次最大的跳跃距离有限制。所以现在问你青蛙每次跳跃最少需要跳多长距离 才能 从第一个石头跳到第二个石头?

分析:

       网上说这题有最短路径解的,生成树解的.本来我是冲着最短路径解法来的,但是看了一遍我觉得这题用二分+并查集(判断1点与2点是否连通)才是比较直观的方法吧.

       首先我们二分出mid值表示青蛙每次能跳跃的最大距离，然后我们遍历所有的边，只要当前边的长度<=mid,就合并当前边连接的两个点所属的连通分量(因为青蛙如果在其中一点上，那么必定能调到另外一点所属分量的所有点上)。最后判断1号点与2号点是否在同一个连通分量，即可知道单次mid的跳跃距离是否足够。
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=200+5;
 
int n;
int fa[maxn];
int findset(int x)
{
    return fa[x]==-1? x:fa[x]=findset(fa[x]);
}
int bind(int u,int v)
{
    int fu=findset(u);
    int fv=findset(v);
    if(fu != fv)
    {
        fa[fu]=fv;
        return 1;
    }
    return 0;
}
 
struct Point
{
    double x,y;
}p[maxn];
double dist[maxn][maxn];
 
bool ok(double mid)
{
    memset(fa,-1,sizeof(fa));
 
    for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++)
    if(dist[i][j]<=mid)
        bind(i,j);
 
    return findset(0)==findset(1);
}
 
int main()
{
    int kase=0;
    while(scanf("%d",&n)==1 && n)
    {
        for(int i=0;i<n;i++)
            scanf("%lf%lf",&p[i].x,&p[i].y);
 
        for(int i=0;i<n;i++)
        for(int j=i;j<n;j++)
            dist[i][j]=dist[j][i]=sqrt((p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y));
 
        double L=0,R=2000;
        while(R-L>1e-5)
        {
            double mid = (R+L)/2;
            if(ok(mid)) R=mid;
            else L=mid;
        }
 
        printf("Scenario #%d\nFrog Distance = %.3lf\n\n",++kase,L);
    }
    return 0;
}