poj 2253

给一个n个节点的无向完全图。
一个路径的距离是路径中权值最大的边
要求1到2的最短路径
普通floyd d[i][j] = min(d[i][j],d[i][k]+d[k][j])
而此题中d[i][j]显然是d[i][k]和d[k][j]两者较大的取小即可

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
#define f first
#define s second
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
PDD a[220];
int n,cas;
double d[220][220];
int main(){
	//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("data.in","r",stdin);
	//freopen("data.out","w",stdout);
	while(cin>>n && n){
		for(int i = 1 ; i <= n;i ++) cin>>a[i].f>>a[i].s;
		for(int i = 1; i<= n;i ++) d[i][i] = 0;
		for(int i = 1 ; i <= n;i ++)
			for(int j = i + 1;j <= n;j ++) 
				d[i][j] = d[j][i] = sqrt((a[i].f-a[j].f)*(a[i].f-a[j].f) +(a[i].s-a[j].s)*(a[i].s-a[j].s));
		for(int k = 1 ;k <= n;k ++)
			for(int i = 1; i <= n; i++) 
				for(int j = 1; j <= n;j ++ )
					d[i][j] = min(d[i][j],max(d[i][k],d[k][j]));
		cout<<"Scenario #"<<++cas<<endl;
		cout<<"Frog Distance = ";
		printf("%.3f\n\n",d[1][2]);
	}
	return 0;
}