poj2253 Dijkstra 求最短路

Frogger

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 20940		Accepted: 6799

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.

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

/*
[cpp] view plaincopyprint?
题目大意求青蛙由起点跳到终点的过程中，在所有的路径中的最大步伐中的最小步伐。题目简单。<p>用Dijkstra算法解，但并非是求最小路径或最
小路径长度。这里是Dijkstra算法的变体，结合贪心算法的思想，在走每一步时，选取距离最小（即步伐最小）的那一步走，每一次走都是在上一步
的基础之上走的，用一个变量u记录每次通过的结点，再用一个变量记录已经走了的路径中的最大步伐，当u等于终点结点的编号时，就停止，输出最
大步伐。详细见代码：*/
[cpp] view plaincopyprint?
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<cmath>
using namespace std;
#define inf 0xfffffff
double edge[250][250],dist[250];
int visit[250];
int n;
struct student
{
double x,y;
}stu[250];
double maxa(double a,double b)
{
	return a>b?a:b;
}
double  distrak()
{
	int i,j,k;
	double maxlv=-1.0;
	for(i=0;i<=n;i++)
	{
	
		dist[i]=edge[0][i];
		visit[i]=0;
		
	}
	visit[0]=1;
	dist[0]=0;
	for(i=0;i<n-1;i++)
	{
	
		int u=0;
		double min=inf;
		for(j=1;j<=n;j++)
		{
		
			if(!visit[j]&&dist[j]<min)
			{
			
				u=j;
				min=dist[j];
			}
		}
		visit[u]=1;
		if(min>maxlv)
			maxlv=min;
		if(u==1)
			return maxlv;
		for(k=1;k<=n;k++)
		{
		
			if(!visit[k]&&edge[u][k]<inf&&maxa(dist[u],edge[u][k])<dist[k])
			{
			
				dist[k]=maxa(dist[u],edge[u][k]);
			
			}
		}
	}
	return dist[1];
}
int main ()
{
	int i,j,flag=1;
	while(scanf("%d",&n)!=EOF&&n)
	{
		for(i=0;i<=n;i++)
			for(j=0;j<=n;j++)
			{
			
				if(i==j)
					edge[i][j]=0;
				else if(edge[i][j]==0)
					edge[i][j]=inf;

			}
		scanf("%lf%lf",&stu[1].x,&stu[1].y);
		scanf("%lf%lf",&stu[0].x,&stu[0].y);
		edge[1][0]=sqrt((stu[1].x-stu[0].x)*(stu[1].x-stu[0].x)+(stu[0].y-stu[1].y)*(stu[0].y-stu[1].y));
		edge[0][1]=edge[1][0];
		if(n==2)
		{
	
		//edge[0][1]=edge[1][0];
		printf("Scenario #%d\n",flag++);
		printf("Frog Distance = %.3f\n\n",edge[1][0]);
			continue;
		}
		
		for(i=2;i<n;i++)
		{
			scanf("%lf%lf",&stu[i].x,&stu[i].y);
			for(j=0;j<i;j++)
			{
			
				edge[i][j]=sqrt((stu[i].x-stu[j].x)*(stu[i].x-stu[j].x)+(stu[i].y-stu[j].y)*(stu[i].y-stu[j].y));
				edge[j][i]=edge[i][j];
			}
		}
		

		printf("Scenario #%d\n",flag++);
		printf("Frog Distance = %.3f\n\n",distrak());
	}
	//printf("\n");
	return 0;
}