Frogger poj 2253 floyd
来源:互联网 发布:淘宝没发货退款要多久 编辑:程序博客网 时间:2024/06/11 16:31
Language:
Frogger
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26411 Accepted: 8591
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
Sample Output
Scenario #1Frog Distance = 5.000Scenario #2Frog Distance = 1.414
Source
Ulm Local 1997
题意:给N个点的坐标,起点为1,终点为2,求从起点到终点所有路径中每条路径上最大步长的最小值。
思路:fioyd变形。
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <string>using namespace std;double mp[222][222];double xy[222][2];//存点的坐标int N;int main(){ int cas=1; while (scanf("%d",&N)&&N) { for (int i=0;i<N;i++) scanf("%lf%lf",&xy[i][0],&xy[i][1]); for (int i=0;i<N;i++) for (int j=0;j<N;j++) mp[i][j]=sqrt( (xy[i][0]-xy[j][0])*(xy[i][0]-xy[j][0]) + (xy[i][1]-xy[j][1])*(xy[i][1]-xy[j][1]) ); for (int k=0;k<N;k++) for (int i=0;i<N;i++) for (int j=0;j<N;j++) mp[i][j]=min(max(mp[i][k],mp[k][j]),mp[i][j]); printf("Scenario #%d\nFrog Distance = %.3f\n\n",cas++,mp[0][1]); } return 0;}
33 0
- 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 (spfa) (Floyd)
- poj 2253 Frogger【Dijkstru&&floyd】
- POJ-2253 Frogger(Dijkstra)(Floyd)
- POJ 2253 Frogger(floyd算法)
- POJ 2253 Frogger (Floyd)
- poj 2253 Frogger(floyd)
- poj 2253 Frogger(floyd变形)
- 字符串匹配
- LRU
- 制作简单网页
- [一步一步写算法导论]合并排序
- LINUX下用TAR方式安装MYSQL方法步骤
- Frogger poj 2253 floyd
- 螺旋队列的另一种解法
- android 在 button、textview等控件按下和选中的时候改变颜色或图片实现方法
- 韩语学习之第十九课
- Ubuntu13.10纯文本模式/终端中文乱码解决方法
- (模板)c++ 大数(正数加减乘除)
- 操作系统内存管理
- 排序算法之直接插入排序
- IOS开发------图片浏览器之UIImageView中的animation