Frogger题解

题目地址

题意：求最短(路径最长边)

题解：如果理解了最短路就可以轻松做出来了。简要还是通过松弛操作来实现对当前最长边的更新。

#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<map>
#include<vector>
#include<set>
#include<cctype>
#include<string>
#include<queue>
#include<cmath>
#define FOR(i,l,r) for(int i=l;i<=r;i++)
using namespace std;

const int maxn=205;

int n;
bool inq[maxn];
double M[maxn][maxn];
double indx[maxn],indy[maxn];
double d[maxn];
queue<int>q; 

inline float spfa(int s,int t){
	q=queue<int>();
	memset(inq,0,sizeof(inq));
	for(int i=1;i<=n;i++){
		d[i]=1000000;	
	}
	q.push(s);
	inq[s]=true;
	d[s]=0;
	while(!q.empty()){
		int now=q.front();q.pop();
		inq[now]=false;
		for(int i=1;i<=n;i++)if(i!=now){
			//cout<<now<<" "<<i<<"-->";
			double ans=max(d[now],M[now][i]);
			//cout<<ans<<" "<<d[i]<<endl;
			if(ans<d[i]){
				d[i]=ans;
				if(!inq[i]){
					inq[i]=true;
					q.push(i);
				}
			}
		}
	}
	//cout<<d[t]<<endl;
	return d[t];
}

int main(){
	int cnt=0;
	while(cin>>n){
		if(n==0)break;
		FOR(i,1,n){
			scanf("%lf%lf",&indx[i],&indy[i]);
		}
		FOR(i,1,n)FOR(j,1,n){
			M[i][j]=sqrt((indx[i]-indx[j])*(indx[i]-indx[j])+(indy[i]-indy[j])*(indy[i]-indy[j]));
		}
		printf("Scenario #%d\n",++cnt);
		printf("Frog Distance = %.3lf\n\n",spfa(1,2));
	}
}