POJ 2253（最短路）dijkstra+floyd+spfa

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

主要是题意难懂，就是让你求最长路中的最短路，转移方程就是 dis[i]=min(dis[i]，max(dis[k]，v[k][i]) )，其它的就正常操作就可以了，因为是刚学最短路，所以写了floyd+dijkstra+spfa,这三种算法前面的处理是一样的，只是后面的核心代码不同

Floyd

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<math.h>
using namespace std;
int n,x[205],y[205];
double v[205][205];
void floyd()
{
   for(int k=1;k<=n;k++)
   {
       for(int i=1;i<=n;i++)
       {
           for(int j=1;j<=n;j++)
           {
            v[i][j]=min(v[i][j],max(v[i][k],v[k][j]));
           }
       }
   }
   return ;
}
int main()
{
    int z=1;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)break;
        memset(v,0,sizeof(v));
        for(int a=1;a<=n;a++)
        {
            scanf("%d%d",&x[a],&y[a]);
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=i;j<=n;j++)
            {
                v[i][j]=v[j][i]=sqrt(double(x[i]-x[j])*(x[i]-x[j])+double(y[i]-y[j])*(y[i]-y[j])); //双向
            }
        }
        floyd();
        printf("Scenario #%d\n",z++);
        printf("Frog Distance = %.3lf\n\n",v[1][2]);
    }
    return 0;
}

Dijkstra

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<math.h>
using namespace std;
int n,inf,x[205],y[205],vis[205];
double v[205][205];
double dis[205];
void dijk()
{
    for(int a=1;a<=n;a++)
        dis[a]=inf;
    dis[1]=0;
    for(int i=1;i<=n;i++)
    {
        int minn=inf,k;
        for(int j=1;j<=n;j++)
        {
            if(minn>dis[j]&&vis[j]==0)
            {
                minn=dis[j];
                k=j;
            }
        }
        vis[k]=1;
        for(int j=1;j<=n;j++)
        {
             dis[j]=min(dis[j],max(dis[k],v[k][j]));
        }
    }
    return ;
}
int main()
{
    int z=1;
    while(scanf("%d",&n)!=EOF)
    {
        inf=99999999;
        memset(dis,0,sizeof(dis));
        memset(vis,0,sizeof(vis));
        if(n==0)break;
        for(int a=1;a<=n;a++)
        {
            scanf("%d%d",&x[a],&y[a]);
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=i;j<=n;j++)
            {
                v[i][j]=v[j][i]=sqrt(double(x[i]-x[j])*(x[i]-x[j])+double(y[i]-y[j])*(y[i]-y[j]));
            }
        }
        dijk();
        printf("Scenario #%d\n",z++);
        printf("Frog Distance = %.3lf\n\n",dis[2]);
    }
    return 0;
}

SPFA+队列优化

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<math.h>
using namespace std;
int n,inf,x[205],y[205],vis[205];
double v[205][205];
double dis[205];
void spfa()
{
   queue<int>q;
   for(int a=1;a<=n;a++)
     vis[a]=0;
   vis[1]=1;
   for(int a=1;a<=n;a++)
    dis[a]=inf;
   dis[1]=0;
   q.push(1);
   while(!q.empty())
   {
       int k=q.front();
       vis[k]=0;
       q.pop();
       for(int i=1;i<=n;i++)
       {
           if(max(dis[k],v[k][i])<dis[i])
           {
               dis[i]=max(dis[k],v[k][i]);
               if(vis[i]==0)
               {
                   q.push(i);
                   vis[i]=1;
               }
           }
       }
   }
}
int main()
{
    int z=1;
    while(scanf("%d",&n)!=EOF)
    {
        inf=99999999;
        memset(dis,0,sizeof(dis));
        memset(vis,0,sizeof(vis));
        if(n==0)break;
        for(int a=1;a<=n;a++)
        {
            scanf("%d%d",&x[a],&y[a]);
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=i;j<=n;j++)
            {
                v[i][j]=v[j][i]=sqrt(double(x[i]-x[j])*(x[i]-x[j])+double(y[i]-y[j])*(y[i]-y[j]));
            }
        }
        spfa();
        printf("Scenario #%d\n",z++);
        printf("Frog Distance = %.3lf\n\n",dis[2]);
    }
    return 0;
}