POJ2253 Frogger之Floyd解法

题意:题意很好懂,就是要求一条路径,这条路径中最大的那一段是所有路径中最大段的最小值

**分析:
设d[i][j]为从i到j的所有路径中,最大段的最小值.
对于d[i][j] 来说,考虑一个新的节点d[i][k]+d[k][j], 如果d[i][j]大于d[i][k]和d[k][j],就可以更新d[i][j].**

---

ps:现在编译规则越来越严了,sqrt和pow太容易出错了!太容易出错了！太容易出错了！以后要注意格式要规范…

---

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;

int n;
int times = 0;
int x[210];
int y[210];
double d[210][210];

void solve()
{
    for (int i = 0; i < n; i += 1){
        for (int j = 0; j < n; j += 1){
            d[i][j] = pow(double(x[j]-x[i]),2)+pow(double(y[j]-y[i]),2);
        }
    }
    for (int k = 0; k < n; k += 1){
        for (int i = 0; i < n; i += 1){
            for (int j = 0; j < n; j += 1){
                    d[i][j] = min(d[i][j],max(d[i][k],d[k][j]));
            }
        }
    }
    printf("Scenario #%d\nFrog Distance = %.3lf\n\n",times,sqrt(d[0][1]));
}

int main()
{
    while (cin >> n,n){
        times++;
        for (int i = 0; i < n; i += 1) scanf("%d%d",&x[i],&y[i]);
        solve();
    }
    return 0;
}