POJ 题目2253 Frogger(最短路变形)
来源:互联网 发布:java知识分享网 编辑:程序博客网 时间:2024/05/22 12:48
Frogger
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 27255 Accepted: 8858
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
ac代码
#include<stdio.h>#include<math.h>#include<string.h>struct s{double x,y;}node[220];double map[220][220];double dis(int i,int j){double x,y;x=node[i].x-node[j].x;y=node[i].y-node[j].y;return sqrt(x*x+y*y);}int main(){int n,t=0;while(scanf("%d",&n)!=EOF,n){int i,j,k;for(i=0;i<n;i++)scanf("%lf%lf",&node[i].x,&node[i].y);memset(map,0,sizeof(map));for(i=0;i<n;i++){for(j=i+1;j<n;j++){map[i][j]=map[j][i]=dis(i,j);}}for(k=0;k<n;k++){for(i=0;i<n;i++)w{for(j=i+1;j<n;j++){if(map[i][k]<map[i][j]&&map[k][j]<map[i][j]){if(map[i][k]<map[k][j])map[i][j]=map[j][i]=map[k][j];elsemap[i][j]=map[j][i]=map[i][k];}}}}printf("Scenario #%d\n",++t);printf("Frog Distance = %.3lf\n\n",map[0][1]);}}
0 0
- POJ 题目2253 Frogger(最短路变形)
- POJ 2253 Frogger(最短路变形)
- 最短路变形 POJ 2253 Frogger
- POJ 2253 Frogger -- 最短路变形
- POJ 2253 Frogger(最短路--floyd变形)
- POJ -- 2253 -- Frogger (最短路变形)
- POJ 2253Frogger(dijk最短路变形)
- POJ 2253 Frogger(最短路变形,floyd算法)
- POJ 2253 Frogger 最短路-Dijkstra的变形形式
- POJ 2253 Frogger (最小生成树 or 最短路变形)
- poj 2253 Frogger (最短路Floyd)
- POJ 2253 Frogger(最短路 Floyd)
- POJ 2253 - Frogger(最短路`dijkstra)
- POJ 2253 Frogger最短路(floyd)
- poj 2253 Frogger (dijkstra最短路)
- POJ-2253 Frogger (最短路)
- POJ 2253 Frogger(最短路/迪杰斯特拉)
- 【Poj】-2253-Frogger(最短路,变化)
- OpenCV学习之CvMat的用法详解及实例(一)
- Java EE
- 2015-1-30-工作日志-刘婉
- Background-Output
- NYOJ 组合数 32(DFS)
- POJ 题目2253 Frogger(最短路变形)
- 使用Rational Rose来绘制UML图
- 蓝桥杯 算法训练 2的次幂表示
- 啊哈C——学习4.6练习
- 字符常量与字符串常量
- IplImage, CvMat, Mat 的前世今生
- OpenCV学习之CvMat的用法详解及实例(二)
- UMEditor调整文本编辑器的组件位置的方法
- OpenCV学习之CvMat的用法详解及实例(三)