您的位置:首页 > 其它

poj 2253 frogger

2016-05-27 20:46 357 查看
Frogger

Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 34779 Accepted: 11162
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

poj 2253 frogger


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#define N 205
#define inf 1<<29
using namespace std;
//minimax, 每组最大的中找最小值
double map

;//记录权值
struct point{
double x;
double y;
}e
;
void inti(int n)
{
int i = 0, j;
int t = n;
double x, y;

while(n--)
{
scanf("%lf%lf", &x, &y);
e[i].x = x;
e[i++].y = y;
}
for(i = 0; i < t-1; i++)//记录权值
for(j = i+1; j < t; j++)
{
x = e[i].x - e[j].x;
y = e[i].y - e[j].y;
map[i][j] = map[j][i] = sqrt(x*x + y*y);//双向
}
}
void floyd(int n)
{
int i, j, k;
for(k = 0; k < n; k++)
for(j = 0; j < n-1; j++)
for(i = j+1; i < n; i++)
if(map[i][j] > map[i][k] && map[i][j] > map[k][j])//一旦有一个比map[i][j]小,就选map[i]][j]
map[i][j] = map[j][i] = map[i][k] > map[k][j] ? map[i][k] : map[k][j];
}
int main()
{
int n;
int no = 0;

while(scanf("%d", &n) && n)
{
inti(n);
floyd(n);
printf("Scenario #%d\n", ++no);
printf("Frog Distance = %.3lf\n\n", map[0][1]);
}

return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: