# POJ2253 Frogger

Frogger
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 34865 Accepted: 11192

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


Source

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int mxn=2000;
int x[mxn],y[mxn];//石头坐标
double mp[210][210];//图
int n;
double dis(int x1,int x2,int y1,int y2){//求两点间距离
return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
void cdis(){//将两点间距离存入邻接矩阵
memset(mp,0,sizeof(0));
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
mp[i][j]=dis(x[i],x[j],y[i],y[j]);
}
return;
}
int main(){
int T=0;
while(scanf("%d",&n) && n){
printf("Scenario #%d\n",++T);
int i,j;
for(i=1;i<=n;i++){
scanf("%d%d",&x[i],&y[i]);
}
cdis();
for(int k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
mp[i][j]=min(mp[i][j],max(mp[i][k],mp[k][j]));
//					printf("%d  %d  %d\n",k,i,j);
//					printf("%.3f  %.3f  %.3f\n",mp[i][j],mp[i][k],mp[k][j]);
}
printf("Frog Distance = %.3f\n\n",mp[1][2]);//注意空行
}
return 0;
}

• 本文已收录于以下专栏：

## poj 2253 Frogger (最长路中的最短路)

• acm_code
• 2014年07月24日 11:21
• 2541

## POJ 2253 Frogger （dijkstra算法 + 预处理）

Frogger Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 27020   Accepted: 8797 ...
• u013446688
• 2015年01月16日 15:18
• 1741

## POJ2253 Frogger(最短路径)

• SeasonJoe
• 2016年04月20日 17:12
• 358

## POJ2253 Frogger(最短路变形，floyd,Dijkstra,spfa)

• riba2534
• 2017年01月17日 15:42
• 587

## POJ2253 - Frogger

• shumino
• 2014年12月08日 23:13
• 151

## poj2253——Frogger

• tzyshiwolaogongya
• 2018年01月22日 14:13
• 13

## poj2253 Frogger

• u012914220
• 2013年11月29日 20:27
• 311

## POJ2253:Frogger

http://poj.org/problem?id=2253  这题与前面POJ2263（在我的前一篇解题报告中有）类似，都是关于Floyd解法的变种，这个需要注意的就是递推式如下： temp...
• Sprithy_Dream
• 2012年04月10日 14:54
• 215

## POJ2253 Frogger

Frogger Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 33139   Accepted: 10656 ...
• wust_ZJX
• 2016年03月05日 16:23
• 295

## poj2253 - Frogger

• qq_33951440
• 2016年11月20日 15:08
• 121

举报原因： 您举报文章：POJ2253 Frogger 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)