Frogger 【POJ - 2253】【最小瓶颈路模板】

题目链接

---

  kruskal重构树，然后当1和2在一个并查集中的时候，那么，说明最小瓶颈路就已经求出来了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define eps 1e-8
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(x, y) make_pair(x, y)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 205;
int N, cnt, root[maxN];
inline int fid(int x) { return x == root[x] ? x : root[x] = fid(root[x]); }
struct node
{
    double x, y;
    void In() { scanf("%lf%lf", &x, &y); }
} a[maxN];
struct E
{
    int u, v; double w;
    E(int a=0, int b=0, double c=0.):u(a), v(b), w(c) {}
    friend bool operator < (E e1, E e2) { return e1.w < e2.w; }
} edge[maxN * maxN];
double _Dis(int u, int v) { return sqrt((a[u].x - a[v].x) * (a[u].x - a[v].x) + (a[u].y - a[v].y) * (a[u].y - a[v].y)); }
int main()
{
    int Cas = 0;
    while(scanf("%d", &N) && N)
    {
        cnt = 0;
        for(int i=1; i<=N; i++) { a[i].In(); root[i] = i; }
        printf("Scenario #%d\nFrog Distance = ", ++Cas);
        for(int i=1; i<N; i++)
        {
            for(int j=i+1; j<=N; j++)
            {
                edge[++cnt] = E(i, j, _Dis(i, j));
            }
        }
        sort(edge + 1, edge + cnt + 1);
        for(int i=1, u, v; i<=cnt; i++)
        {
            u = fid(edge[i].u); v = fid(edge[i].v);
            if(u ^ v)
            {
                root[u] = v;
            }
            if(fid(1) == fid(2))
            {
                printf("%.3f\n\n", edge[i].w);
                break;
            }
        }
    }
    return 0;
}