POJ 2253 Frogger 最短路

题意：给你n个石头 一个青蛙在上面蹦 问你从起点蹦到终点的最大距离最小是多少

思路：用一个数组min_dis保存从起点到当前点所经过的最大距离最小值bfs遍历全图 则对于两个点u v 如果max(dis[u][v], min_dis[u]) < min_dis[v] 更新min_dis[v] 并把v加入队列重新更新以v为起点的路径    这题也可以用floyed搞 方法就是if(dis[i][j] > dis[i][k] && dis[i][j] > dis[k][j])  因为要保存某一条路径的最大值 所以要更新dis[j][i] = dis[i][j] = max(dis[i][k], dis[k][j]); 这样做也同时保证了i到j的最大距离变小

WA了一早上 结果发现这题是POJ的 %lf要用C++交 dt的不行

bfs()的方法

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;

const int maxn = 200 + 10;
const double INF = 1e9;

int n, cas = 0;
double min_dis[maxn], dis[maxn][maxn];
pair<double, double> pill[maxn];

double get_dis(int i, int j){
          return sqrt((pill[i].first - pill[j].first) * (pill[i].first - pill[j].first) +
                      (pill[i].second - pill[j].second) * (pill[i].second - pill[j].second));
}

void bfs(){
          queue<int> Q;
          Q.push(0);
          while(!Q.empty()){
                    int cur = Q.front(); Q.pop();
                    for(int i = 0; i < n; i++)if(i != cur){
                              if(max(dis[i][cur], min_dis[cur]) < min_dis[i]){
                                        min_dis[i] = max(dis[i][cur], min_dis[cur]);
                                        Q.push(i);
                              }
                    }
          }
}

void solve(){
          for(int i = 0; i < n; i++) min_dis[i] = INF;
          min_dis[0] = 0;
          for(int i = 0; i < n; i++) scanf("%lf%lf", &pill[i].first, &pill[i].second);
          for(int i = 0; i < n; i++)
          for(int j = i+1; j < n; j++)
                    dis[i][j] = dis[j][i] = get_dis(i, j);
          bfs();
          printf("Scenario #%d\n", ++cas);
          printf("Frog Distance = %.3lf\n", min_dis[1]);
          printf("\n");
}

int main()
{
          while(scanf("%d", &n) && n) solve();
          return 0;
}

floyed的方法

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;

const int maxn = 300;
const double INF = 1e9;

double dis[maxn][maxn];
pair<double, double> pill[maxn];
int n, cas = 0;

double get_dis(int i, int j){
          return sqrt((pill[i].first - pill[j].first) * (pill[i].first - pill[j].first) +
                      (pill[i].second - pill[j].second) * (pill[i].second - pill[j].second));
}

void solve(){
          for(int i = 0; i < n; i++) scanf("%lf%lf", &pill[i].first, &pill[i].second);
          for(int i = 0; i < n; i++)
          for(int j = 0; j < n; j++)if(i != j)
          dis[i][j] = dis[j][i] = get_dis(i, j);
          for(int k = 0; k < n; k++)
          for(int i = 0; i < n; i++)
          for(int j = 0; j < n; j++){
                    if(dis[i][j] > dis[i][k] && dis[i][j] > dis[k][j])
                              dis[j][i] = dis[i][j] = max(dis[i][k], dis[k][j]);
          }
          printf("Scenario #%d\n", ++cas);
          printf("Frog Distance = %.3f\n", dis[0][1]);
          printf("\n");
}


int main()
{
          while(scanf("%d", &n) && n) solve();
          return 0;
}