POJ2253 Frogger ——floyd 存二维坐标方式

POJ2253

 

题没什么特别的，注意这种存二位坐标的方式：先用x y数组存储n个点的坐标，然后通过循环把n个点间每个点的距离存成图。跑floyd即可

// Decline is inevitable, romance will last forever.
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cstdio>
using namespace std;
#define mst(a, x) memset(a, x, sizeof(a))
#define INF 0x3f3f3f3f
#define P 998244353
#define int long long
const int maxn = 300+ 10;
const int maxm = 2e5 + 10;
double Map[maxn][maxn];
double x[maxn], y[maxn];
int n;
void floyd() {
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++) {
                Map[i][j] = min(Map[i][j], max(Map[i][k], Map[k][j]));
            }
}
void solve() {
    int t = 0;
    while(cin >> n && n) {
        if(t++)
            cout << endl;
        
        mst(Map, 0);
        for(int i = 1; i <= n; i++) {
            cin >> x[i] >> y[i];
        }
        for(int i = 1; i <= n; i++)
            for(int j = i + 1; j <= n; j++) {
                Map[i][j] = Map[j][i] = sqrt((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]));
            }
        floyd();
        printf("Scenario #%lld\nFrog Distance = %.3lf\n", t, Map[1][2]);
    }
}
signed main() {
//    int t; cin >> t; while(t--)
    solve();
    return 0;
}