B - Frogger Dijkstra算法变形
2017-11-03 20:36
253 查看
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
求所有路径中最大值中的最小值。
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
题解:
Dijkstra算法变形。修改lowcost为1到n的最大边即可。求所有路径中最大值中的最小值。
代码:
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 210; struct Point { int x,y; }; Point point[MAXN]; bool vis[MAXN]; double cost[MAXN][MAXN]; double lowcost[MAXN]; double dist(Point a,Point b) { return sqrt((double)((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))); } void Dijkstra(double lowcost[],double cost[][MAXN],int n,int beg) { for(int i=1;i<=n;i++) { vis[i]=false; lowcost[i]=INF; } lowcost[beg]=0; for(int j=0;j<n;j++) { int k = -1; int MIN = INF; for(int i=1;i<=n;i++) { if(!vis[i]&&lowcost[i]<MIN) { MIN = lowcost[i]; k=i; } } if(k==-1) break; vis[k]=true; for(int i=1;i<=n;i++) { lowcost[i]=min(lowcost[i],max(lowcost[k],cost[k][i])); } } } int main() { int T=0; int n; while(cin>>n&&n) { for(int i=1;i<=n;i++) { cin>>point[i].x>>point[i].y; } for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { cost[j][i]=cost[i][j]=dist(point[i],point[j]); } Dijkstra(lowcost,cost,n,1); if(T) cout<<endl; printf("Scenario #%d\nFrog Distance = %.3lf\n", ++T, lowcost[2]); } return 0; }
相关文章推荐
- Dijkstra算法的简单变形 pku 2253 Frogger
- POJ 2472 ||SDUT 2358 106 miles to Chicago(Dijkstra算法变形)
- POJ 2253 Frogger -- 最短路变形
- Frogger POJ - 2253 最短路变形 Bellman-Ford
- POJ 2253 Frogger(最短路变形)
- Pku acm 2253 Frogger数据结构题目解题报告(六)—单源最短路径:Dijkstra算法
- POJ 2253 Frogger (dijkstra变形)
- 【算法系列学习】Dijkstra算法变形 [kuangbin带你飞]专题四 最短路练习
- POJ 2253 Frogger(最短路径Dijkstra算法和floyd算法)
- POJ 2253 Frogger【SPFA变形】
- POJ2253 Frogger 最短路变形
- POJ 2253 Frogger(迪杰斯特拉变形)
- POJ -- 2253 -- Frogger (最短路变形)
- POJ 2253 Frogger (Floyd的变形)
- POJ 2253 Frogger (求每条路径中最大值的最小值,Dijkstra变形)
- poj 2253 Frogger(dijkstra变形,好题)
- POJ 2253 Frogger(最短路的变形)
- Frogger【最小生成树的变形】---路径上最小的最大权
- poj 2253 Frogger dijkstra算法实现
- POJ 2253 Frogger(dijkstra变形)