POJ 2253 Frogger(Floyd)
来源:互联网 发布:时间压缩 知乎 编辑:程序博客网 时间:2024/05/29 16:08
Frogger
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26450 Accepted: 8607
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
20 03 4317 419 418 50
求两只青蛙所有路径中的一个最长距离的最小值
#include <iostream>#include <cstring>#include <cstdio>#include <cmath>using namespace std;double s[211][211];int n;void Floyd(){ for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++) s[j][k] = min(s[j][k],max(s[j][i],s[i][k]));}int main(){ double x[211],y[211]; int t=1; while(scanf("%d",&n),n) { for(int i=0;i<n;i++) cin>>x[i]>>y[i]; for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) s[i][j]=s[j][i]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])); s[i][i]=0; } Floyd(); printf("Scenario #%d\n",t++); printf("Frog Distance = %.3lf\n\n",s[0][1]); } return 0;}
0 0
- POJ 2253 Frogger (Floyd)
- POJ 2253 Frogger(Floyd)
- POJ 2253 Frogger (Floyd)
- poj 2253 Frogger(floyd)
- POJ 2253 Frogger Floyd
- 【Floyd】-POJ-2253-Frogger
- Frogger poj 2253 floyd
- poj 2253 Frogger (floyd)
- poj 2253 Frogger (floyd)
- POJ-2253 Frogger (Floyd)
- POJ 2253 Frogger 【Floyd】
- 【POJ 2253 Frogger】+ Floyd
- poj 2253 Frogger (最短路Floyd)
- poj 2253 Frogger (floyd算法)
- POJ 2253 Frogger(最短路 Floyd)
- POJ 2253 Frogger最短路(floyd)
- POJ 2253 Frogger(floyd 或 dijstra)
- POJ 2253 Frogger(Dijkstra or Floyd)
- 长帝烤箱怎么样好吗 长帝烤箱哪个型号好
- USTC邮箱填写表单并登陆
- 详解java中的volatile关键字
- 个人软件项目的心得
- POJ2386 简单的深搜
- POJ 2253 Frogger(Floyd)
- 版本控制之最佳实践(Git版)
- HDU 1257 最少拦截系统
- php连接两个表然后查询数据代码,
- java 泛型
- HDU 1874 畅通工程续 (基础最短路)
- Binder结点管理
- python 调用图灵机器人api实现简单的人机交互
- 间谍飞哥点击返回家地方规划电工房电话发个电话发个