Frogger POJ - 2253（Floyd最短路变形）

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.

题意：求两个点之间各条路径中最大跳的最小值

思路：直接用Floyd来计算任何两点之间的距离，因为求的不是最短路，所以这个得变形一下，最短路中Floyd的原理是遍历每个点选出i,j两点的距离和经过k点的两点距离的最小值，这里，如果 d[i][k] 和 d[k][j] 的最大值都比d[i][j]小，那么就可以用他们的最大值来代替d[i][j]成为更短的一条，但又是这一条路径中的最大的一跳。

注意一点！！！poj的G++得用%f而不能用%lf，wa了半天看网上题解才知道的 0.0

代码：

#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <cctype>
#include <sstream>
#define INF 0x3f3f3f3f
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const int maxn = 2e2 + 5;
const int mod = 1e8 + 7;

int n,k=0;
double d[maxn][maxn];
struct point {
    double x, y;
} p[maxn];
double dis(point a, point b) {
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
int main() {
    //freopen ("in.txt", "r", stdin);
    while (~scanf ("%d", &n) && 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+1; j < n; j++) {
                d[i][j] = d[j][i] = dis(p[i], p[j]);
            }
        }
        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    double tmp = max(d[i][k], d[k][j]);
                    d[i][j] = min(d[i][j], tmp);
                }
            }
        }
        printf ("Scenario #%d\nFrog Distance = %.3f\n\n",++k,d[0][1]);
    }
    return 0;
}