poj 2253 Frogger 最小瓶颈路（变形的最小生成树 prim算法解决(需要很好的理解prim)）

传送门：

http://poj.org/problem?id=2253

Frogger

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 58328		Accepted: 18293

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

分析：
题目意思：青蛙a在石头1上，青蛙b在石头2上，青蛙a要去找青蛙b玩，问你从从石头1到石头2的最短路里最大的距离是多少

做法：
可以用prim写，但是prim是求MST的，这样只要求1到2的最短路上的最大边就可以了
找j的时候，找到了2就跳出去
注意：
代码里面是0号石头 ，1号石头，而不是分析中的1号，2号石头

code：

#include <iostream>
#include <cstdio>
#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<math.h>
#include<memory>
using namespace std;
typedef long long LL;
#define INF 0x3f3f3f3f
#define max_v 205
struct node
{
    double x,y;
}p[max_v];
double g[max_v][max_v];
int n,c=;
void init()
{
    for(int i=;i<n;i++)
        for(int j=;j<n;j++)
        g[i][j]=INF;
}
void prim(int s)
{
    double lowcost[n];
    int used[n];
    for(int i=;i<n;i++)
    {
        lowcost[i]=g[s][i];
        used[i]=;
    }
    double ans=;
    used[s]=;
    for(int i=;i<n;i++)
    {
        int j=;
        for(int k=;k<n;k++)
        {
            if(!used[k]&&lowcost[k]<lowcost[j])
                j=k;
        }
        if(j==)
            break;
        ans=max(ans,lowcost[j]);
        used[j]=;
        if(j==)
            break;
        for(int k=;k<n;k++)
        {
            if(!used[k]&&g[j][k]<lowcost[k])
            {
                lowcost[k]=g[j][k];
            }
        }
    }
    printf("Scenario #%d\n",c++);
    printf("Frog Distance = %0.3f\n\n",ans);
}
double f(int i,int j)
{
    double x=p[i].x-p[j].x;
    double y=p[i].y-p[j].y;
    return sqrt(x*x+y*y);
}
int main()
{
    while(~ scanf("%d",&n))
    {
        if(n==)
            break;
        for(int i=;i<n;i++)
        {
            scanf("%lf %lf",&p[i].x,&p[i].y);
        }
        init();
        for(int i=;i<n;i++)
        {
            for(int j=i+;j<n;j++)
            {
                g[i][j]=g[j][i]=f(i,j);
            }
        }
        prim();
    }
    return ;
}