本题类似于上一篇的卡车容量;有一句话需要理解:石头之间的青蛙距离,定义为在所有的路径之中两块石头之间的最大跳跃距离的最小值。(最小最大距离)
#include <iostream>
#include <cstring>
#include <cmath>
#include <iomanip>
using namespace std;
#define MIN(a, b) (a > b ? b : a)
#define MAX(a, b) (a > b ? a : b)
#define FUN(a, b) (a*a + b*b)
const int MAXN = 210;
double dist[MAXN][MAXN];
int n;
struct Node
{
double x, y;
}nodeco[MAXN];//每块石头的做标
void Floyd()
{
int i, j, k;
for(k = 1; k <= n; ++k)
for(i = 1; i<= n; ++i)
for(j = 1; j <= n; ++j)
dist[i][j] = MIN(dist[i][j], MAX(dist[i][k], dist[k][j]));//i到j的路径中的做大跳跃距离的最小值
}
int main()
{
int i,j;
int kcase = 0;
while( cin>>n && n)
{
memset(dist, 0, sizeof(dist));
for(i = 1; i <= n; ++i)
cin>>nodeco[i].x>>nodeco[i].y;
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)//也是一个建图过程
dist[i][j] = sqrt(FUN(fabs(nodeco[i].x - nodeco[j].x) , fabs(nodeco[i].y - nodeco[j].y)));
Floyd();
cout<<"Scenario #"<<++kcase<<endl;
cout<<"Frog Distance = "<<fixed<<setprecision(3)<<dist[1][2]<<endl;
cout<<endl;
}
return 0;
}