POJ2253-Frogger Floyd

Frogger

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 56007		Accepted: 17619

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.

链接

一、题意

        湖中有n个石头，现在有一只青蛙要从石头1到达石头2，从石头1到达石头2的路径中，记最长的跨越距离为d，现在要求这个d的最小值。

二、思路

        这道题用了Floyd的一种变形。设数组dis[i][j]记录了从i到j的路径中最长的跨越距离，因为所有石头之间都是可达的，所以初始化为直接距离，利用Floyd的思想，遍历所有路径更新dis数组，便可以得到这个值的最小值。

三、代码

#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;
typedef long long ll;
const int MAXN = 500;
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int INF = 2000000000;//0x7fffffff
const double EPS = 1e-9;
const double PI = 3.14159265358979;
const int dir_4r[] = { -1, 1, 0, 0 };
const int dir_4c[] = { 0, 0, -1, 1 };
const int dir_8r[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
const int dir_8c[] = { -1, 0, 1, -1, 1, -1, 0, 1 };

struct Node {
	int x;
	int y;
};

double calc(const Node &a, const Node &b) {
	double x = a.x - b.x;
	double y = a.y - b.y;
	return sqrt(x * x + y * y);
}

Node node[MAXN];
double dis[MAXN][MAXN];

void Floyd(int n) {
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j)
			dis[i][j] = calc(node[i], node[j]);

	for (int k = 0; k < n; ++k)
		for (int i = 0; i < n; ++i)
			for (int j = 0; j < n; ++j)
				dis[i][j] = min(dis[i][j], max(dis[i][k], dis[k][j]));
}

int main() {
	int n, x, y;
	int kase = 1;
	while (scanf("%d", &n) && n) {
		for (int i = 0; i < n; ++i) {
			scanf("%d%d", &x, &y);
			node[i].x = x;
			node[i].y = y;
		}

		Floyd(n);

		printf("Scenario #%d\n", kase++);
		printf("Frog Distance = %.3f\n\n", dis[0][1]);
	}

	//system("pause");
	return 0;
}