poj 2253 Frogger (Dijkstra)

最新推荐文章于 2021-02-26 10:52:03 发布

原创最新推荐文章于 2021-02-26 10:52:03 发布 · 150 阅读

本内容遵循CC 4.0 BY-SA版权协议

本文深入解析了经典游戏Frogger中青蛙跳跃路径的计算方法，通过计算石头间的距离，寻找从Freddy到Fiona青蛙之间的最短跳跃路径。文章详细介绍了如何使用图论中的最短路径算法，如Dijkstra算法，来解决这一问题。

Frogger
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

Sample Output

Scenario #1
Frog Distance = 5.000

Scenario #2
Frog Distance = 1.414

题意描述：已知Freddy石头、Fiona石头和其他石头的的坐标，要求计算弗雷德和菲奥娜青蛙之间的距离。
解题思路：我首先先求出石头之间的距离，然后再能到达菲奥娜石头的路径中选取最大的跳跃距离，其次再从所求得的最大的距离中选取最小的来输出。

实现代码：

#include<stdio.h>
#include<string.h>
#include<math.h>
int inf=99999999;
int book[1050],min,a[1050],b[1050];
double e[1050][1050],dis[1050];
int main()
{
	int i,j,k,u,v,n;
	k=0;
	while(scanf("%d",&n),n!=0)
	{
		memset(e,0,sizeof(e));
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
			{
				if(i==j)
					e[i][j]=0;
				else
					e[i][j]=inf;
			}
		for(i=1;i<=n;i++)
			scanf("%d%d",&a[i],&b[i]);
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				e[i][j]=sqrt((a[i]-a[j])*(a[i]-a[j])*1.0+(b[i]-b[j])*(b[i]-b[j]));
		for(i=1;i<=n;i++)
			dis[i]=e[1][i];
		for(i=1;i<=n;i++)
			book[i]=0;
		book[1]=1;
		for(i=1;i<=n-1;i++)
		{
			min=inf;
			for(j=1;j<=n;j++)
			{
				if(book[j]==0&&dis[j]<min)
				{
					min=dis[j];
					u=j;
				}
			}
			book[u]=1;
			for(v=1;v<=n;v++)
			{
				if(e[u][v]<inf)
				{
					if(dis[v]>dis[u]&&dis[u]>=e[u][v])
						dis[v]=dis[u];
					else if(e[u][v]<dis[v]&&e[u][v]>=dis[u])
						dis[v]=e[u][v];
				}
			}
		}
		printf("Scenario");
		printf(" #%d\n",++k);
		printf("Frog Distance");
		printf(" = %.3lf\n\n",dis[2]);
	}
	return 0;
}