题目:http://poj.org/problem?id=2253
题意:求1到2边上最小的距离
想法:spfa。dis[]数组存放距离,今天晚上好累= =不多写了。。
AC代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
const int INF=0x3f3f3f3f;
const int maxn=220;
bool vis[maxn];
double dis[maxn],link[maxn][maxn];
int x[maxn],y[maxn];
queue <int> ss;
int n;
double ssqrt(int i,int j){
return sqrt((double)((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])));
}
void spfa(){
for(int i=1;i<=n;i++)
dis[i]=INF;
dis[1]=0;
memset(vis,false,sizeof(vis));
vis[1]=true;
ss.push(1);
while(!ss.empty()){
int ex=ss.front();
ss.pop();
vis[ex]=false;
for(int i=1;i<=n;i++){
if(dis[i]>link[ex][i]&&dis[i]>dis[ex]){
dis[i]=max(link[ex][i],dis[ex]);
if(!vis[i]){
vis[i]=true;
ss.push(i);
}
}
}
}
printf("%.3lf\n\n",dis[2]);
}
int main(){
//freopen("123.txt","r",stdin);
int k=1;
while(scanf("%d",&n)!=EOF&&n!=0){
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
link[i][j]=INF;
for(int i=1;i<=n;i++){
scanf("%d%d",&x[i],&y[i]);
for(int j=1;j<i;j++)
link[j][i]=link[i][j]=ssqrt(i,j);
}
printf("Scenario #%d\n",k++);
printf("Frog Distance = ");
spfa();
}
return 0;
}