POJ 2253 Frogger
来源:互联网 发布:车铣复合y轴进给编程 编辑:程序博客网 时间:2024/04/30 07:42
Frogger
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19130 Accepted: 6222
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-----------------------------------------------------------------------------------------------
求两点间所有路径的最大跳跃距离的最小值
dijkstra的变体
#include <iostream>#include <cmath>#include <iomanip>#define OO 999999using namespace std;double mind;int n,p;double a[500][500];double d[500];int v[500];int ax[500];int ay[500];int main(){ int loop=0; cout<<fixed; cout<<setprecision(3); while (cin>>n) { if (n==0) break; loop++; for (int i=0;i<n;i++) { cin>>ax[i]>>ay[i]; } for (int i=0;i<n;i++) { for (int j=0;j<n;j++) { a[i][j]=sqrt( (ax[i]-ax[j])*(ax[i]-ax[j])+(ay[i]-ay[j])*(ay[i]-ay[j]) ); } } for (int i=0;i<n;i++) { d[i]=OO; v[i]=false; } d[0]=0; for (int i=0;i<n;i++) { mind=OO; for (int j=0;j<n;j++) { if (!v[j]&&d[j]<mind) { mind=d[j]; p=j; } } v[p]=true; for (int j=0;j<n;j++) { if (!v[j]&&a[j][p]!=0) { if (d[j]>max(a[j][p],d[p])) { d[j]=max(a[j][p],d[p]); } } } } cout<<"Scenario #"<<loop<<endl; cout<<"Frog Distance = "<<d[1]<<endl; cout<<endl; } return 0;}
- poj 2253 - Frogger --- SPFA
- poj 2253 - Frogger --- dijkstra
- POJ 2253 Frogger
- poj 2253 Frogger
- poj 2253 Frogger
- poj 2253 Frogger
- POJ 2253 Frogger Floyd
- poj 2253 : Frogger (dijkstra)
- Poj 2253 Frogger
- POJ 2253 Frogger
- poj 2253 Frogger
- poj 2253 Frogger
- poj 2253 Frogger
- poj 2253 Frogger
- poj-2253-Frogger
- POJ 2253 Frogger
- POJ 2253 Frogger
- POJ 2253 Frogger
- Delphi接口的底层实现
- 温故知新--接口和抽象类的区别
- 几种华丽无比开发方式
- 软件随想录(local.joelonsoftware.com/wiki)-2000年04月11日 使用介面设计手冊第二章 - User Interface Design for Programmers
- 项目中用ajax的好处和缺点
- POJ 2253 Frogger
- ssh-keygen+ssh-copy-id 在linux下实现ssh无密码登录访问
- tomcat架构以及生命周期
- 关于ios中编译ffmpeg0.9.2库
- 不用存储过程怎么处理大批量数据?读取大批量数据
- 子进程自父进程继承什么或未继承什么
- 清空数组:ZeroMemory、memset 和 “={0}” 三者用于清零操作的区别
- Linux 下编译 redis 和 phpredis
- 我的框架之一 model层