poj_2253

最短路的变形。在一般最短路中，dis[i]的意思表示的是从源点到i点的最短路径，在此题中，我们把dis[i]的意思理解为从源点到i点的路径中使得最长路最短的长度。那么松弛条件也要相应的变化。
改为

for(int j=0;j<n;j++)
  if(!vis[j]&&dis[j]>max(mmin,mp[flag][j]))
    dis[j] = max(mmin,mp[flag][j]);

这样就可以啦。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-10
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
int n,m,k;
int s;
#define N 210
double mp[N][N];
int vis[N];
struct Node{
    int x,y;
}a[N];
double getDis(Node node1,Node node2){
    return sqrt((node1.x-node2.x)*(node1.x-node2.x)*1.0+(node1.y-node2.y)*(node1.y-node2.y)*1.0);
}
double Dijkstra(){
    double dis[N];
    memset(vis,0,sizeof vis);
    for(int i=1;i<=n;i++)
        dis[i] = mp[1][i];
    double mmin = INF;
    int flag;
    for(int i=1;i<n;i++){
        mmin = INF;
        flag = -1;
        for(int j=1;j<=n;j++)
            if(!vis[j] && mmin>dis[j])
                mmin = dis[flag=j];
        if(flag == -1) break;
        vis[flag] = 1;
        for(int j=1;j<=n;j++){
            if(!vis[j] && dis[j]>Max(mmin,mp[flag][j]))
                dis[j] = Max(mmin,mp[flag][j]);
        }
    }
    return dis[2];
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    int kas = 1;
    while(scanf("%d",&n)!=EOF && n){
        for(int i=1;i<=n;i++)
            sfd(a[i].x,a[i].y);
        memset(mp,0,sizeof mp);
        for(int i=1;i<=n;i++){
            for(int j=i;j<=n;j++){
                mp[i][j] = mp[j][i] = getDis(a[i],a[j]);
            }
        }
        printf("Scenario #%d\n",kas++);
        printf("Frog Distance = %.3f\n\n",Dijkstra());
    }
return 0;
}