1 #include <iostream>
 2 #include <cstdlib>
 3 #include <cstring>
 4 #include <cstdio>
 5 #include <cmath>
 6 #include <algorithm>
 7 #include <vector>
 8 #include <queue>
 9 using namespace std;
10
11
12 #define INF 0x3f3f3f3f
13 #define N 300
14 struct node
15 {
16     int x, y;
17 };
18
19 double dist[N];
20 double G[N][N];
21 int vis[N], n;
22
23 void IN()
24 {
25     memset(vis, 0, sizeof(vis));
26
27     for(int i=1; i<=n; i++)
28     {
29         dist[i]=INF;
30         for(int j=1; j<=i; j++)
31             G[i][j]=G[j][i]=INF;
32     }
33 }
34
35 void Floyd()
36 {
37     for(int k=1; k<=n; k++)
38     {
39         for(int j=1; j<=n; j++)
40         {
41             for(int i=1; i<=n; i++)
42             {
43                 if(G[j][i] > max(G[j][k], G[k][i]))
44                 G[j][i] = max(G[j][k], G[k][i]);
45             }
46         }
47     }
48 }
49
50 int main()
51 {
52    int i, j, t=1;
53
54    while(scanf("%d", &n), n)
55    {
56        double  w;
57        node s[N];
58        memset(s, 0, sizeof(s));
59        IN();
60
61        for(i=1; i<=n; i++)
62            scanf("%d%d", &s[i].x, &s[i].y);
63
64        for(i=1; i<n; i++)
65        for(j=i+1; j<=n; j++)
66        {
67            w = sqrt((s[i].x-s[j].x)*(s[i].x-s[j].x)*1.0 + (s[i].y-s[j].y)*(s[i].y-s[j].y)*1.0);
68            G[i][j] = G[j][i]=min(G[i][j], w);
69        }
70
71        printf("Scenario #%d\n", t++);
72
73        Floyd();
74
75        printf("Frog Distance = %.3f\n\n", G[1][2]);
76
77    }
78     return 0;
79 }

 #include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>#include<queue>using namespace std;#define INF 0xfffffff#define N 1100struct node{int x, y;}a[N];int n, vis[N];
double dist[N], G[N][N];void Dij()
{int i, j;for(i=1; i<=n; i++){dist[i] = G[1][i];vis[i] = 0;}vis[1] = 1;for(i=1; i<n; i++){int index=1;double Min=INF;for(j=1; j<=n; j++){if(!vis[j] && dist[j]<Min){Min = dist[j];index = j;}}if(index==1)continue;vis[index] = 1;for(j=1; j<=n; j++)if(!vis[j] && max(dist[index], G[index][j])<dist[j])dist[j] = max(dist[index], G[index][j]);}
}int main()
{int iCase = 1;while(scanf("%d", &n), n){int i, j;for(i=1; i<=n; i++)scanf("%d%d", &a[i].x, &a[i].y);for(i=1; i<=n; i++)for(j=1; j<=i; j++){double d = sqrt( (a[i].x-a[j].x)*(a[i].x-a[j].x) + (a[i].y-a[j].y)*(a[i].y-a[j].y) );G[i][j] = G[j][i] = d;}Dij();printf("Scenario #%d\n", iCase++);printf("Frog Distance = %.3f\n\n", dist[2]);}return 0;
}

#include <iostream>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
const int INF = (1<<30)-1;
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define N 1100struct node
{int x, y;
}a[N];int n, m;
double dist[N], G[N][N];
int vis[N];double prim()
{int i, j;double ans = -1;for(i=1; i<=n; i++)dist[i] = G[1][i];dist[1] = 0;memset(vis, 0, sizeof(vis));vis[1] = 1;for(i=1; i<=n; i++){int index = 1;double Min = INF;for(j=1; j<=n; j++){if(!vis[j] && dist[j]<=Min){Min = dist[j];index = j;}}if(index==1) break;vis[index] = 1;ans = max(ans, Min);if(index==2) return ans;for(j=1; j<=n; j++){if(!vis[j] && dist[j]>G[index][j])dist[j] = G[index][j];}}return ans;
}int main()
{int  iCase=1;while(scanf("%d", &n), n){int i, j;memset(a, 0, sizeof(a));for(i=1; i<=n; i++)scanf("%d%d", &a[i].x, &a[i].y);for(i=1; i<=n; i++)for(j=1; j<=i; j++)G[i][j] = G[j][i] = sqrt( (a[i].x-a[j].x)*(a[i].x-a[j].x) + (a[i].y-a[j].y)*(a[i].y-a[j].y) );printf("Scenario #%d\n", iCase++);printf("Frog Distance = %.3f\n\n", prim());}return 0;
}