杭电-2553-Frogger（最短路径）

Language:Default

Frogger

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37624 Accepted: 12117

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

20 03 4317 419 418 50

Sample Output

Scenario #1Frog Distance = 5.000Scenario #2Frog Distance = 1.414

这道题就是求1--》2最短路径

<span style="font-size:18px;">#include <string.h>#include <stdio.h>#include <algorithm>#include <string>#include <math.h>using namespace std;const double INF=1e20;double cost[210][210];double dist[210];bool vis[210];struct node{int x,y;} p[210];double dis(node A,node B){    return sqrt((double)(A.x-B.x)*(A.x-B.x)+(B.y-A.y)*(B.y-A.y));}void Dijkstra(int n,int beg){    for(int i=1;i<=n;i++)    {        dist[i]=INF;        vis[i]=false;    }    dist[beg]=0;    for(int j=0;j<n;j++)    {        int k=-1;        double Min=INF;        for(int i=1;i<=n;i++)            if(!vis[i]&&dist[i]<Min)            {                Min=dist[i];                k=i;            }        if(k==-1)   break;        vis[k]=true;        for(int i=1;i<=n;i++)            if(!vis[i]&&max(dist[k],cost[k][i])<dist[i] )                dist[i]=max(dist[k],cost[k][i]);    }}int main(){    int n;    int x,y;    int Case=0;    while(scanf("%d",&n),n)    {    for(int i=1;i<=n;i++)    //初始化     {    for(int j=1;j<=n;j++)    {    if(i==j)      cost[i][j]=0;    else      cost[i][j]=INF;}}               for(int i=1;i<=n;i++)        {            scanf("%d%d",&x,&y);            p[i].x=x;            p[i].y=y;        }        for(int i=1;i<=n;i++)            for(int j=i;j<=n;j++)            {                cost[j][i]=cost[i][j]=dis(p[i],p[j]);   //找到任意两点间的权值             }        Dijkstra(n,1);printf("Scenario #%d\n",++Case);        printf("Frog Distance = %.3f\n\n",dist[2]);    }    return 0;}</span>

---

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator