Frogger
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 24323 | Accepted: 7905 |
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.
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
Source
Ulm Local 1997
本题题意:找出由A到B的所有路径,每个路径的最大值,所有最大值中的最小值输出
floyd算法,求解两点之间的最短路,更改一下,储存所有路径的最大值中的最小值,初始时只有一条路,直接为m[i][j],每增加一个点就意味着,多出两条边m[i][k],m[k][j],由新增加的点会增加出很多全新的路径,新
路径的最大值中的最小值可能为原来的最小值,也可能是m[i][k],m[k][j]中的最大值
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#define max_d 9999999.0
using namespace std;
struct node
{
int x , y ;
} p[300];
int n , pre[300] , flag[300] ;
double m[300][300] ;
double dis[300] ;
int main()
{
int i , j , k , temp = 0 ;
while(scanf("%d", &n) && n)
{
temp++ ;
for(i = 0 ; i < n ; i++)
scanf("%d %d", &p[i].x, &p[i].y);
for(i = 0 ; i < n ; i++)
for(j = i ; j < n ; j++)
{
m[i][j] = m[j][i] = sqrt( (p[i].x-p[j].x)*(p[i].x-p[j].x)*1.0 + (p[i].y-p[j].y)*(p[i].y-p[j].y)*1.0 ) ;
}
for(k = 0 ; k < n ; k++)
{
for(i = 0 ; i < n ; i++)
{
for(j = 0 ; j < n ; j++)
{
double s = max(m[i][k],m[k][j]);
m[i][j] = min(s,m[i][j]);
}
}
}
printf("Scenario #%d\n", temp);
printf("Frog Distance = %.3lf\n\n", m[0][1]);
}
return 0;
}