HNUCM 1370 巍巍岳麓 (贪心 Kruskal)

题目链接:http://acm.hnucm.edu.cn/JudgeOnline/problem.php?id=1370

首先把s,t连起来，然后Kruskal贪心选择小边

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <cmath>
#define rep(i, s, e) for(int i = s; i < e; ++i)
#define P pair<int, int>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
static const int MAX_N = 3e3 + 5;
static const ll Mod = 1e9 + 7;
struct Node{
    int u, v, w;
    Node(){}
    Node(int _u, int _v, int _w){u = _u; v = _v; w = _w;}
    bool operator < (const Node &r)const{
        return w < r.w;
    }
};
Node edge[4005];
int pre[MAX_N];
int cnt;
void addEdge(int u, int v, int w){
    edge[cnt++] = Node(u, v, w);
}
void make_set(int n){
    cnt = 0;
    for(int i = 1; i <= n; ++i) pre[i] = i;
}
int find_set(int x){
    if(pre[x] != x) pre[x] = find_set(pre[x]);
    return pre[x];
}
void union_set(int x, int y){
    int fx = find_set(x), fy = find_set(y);
    if(fx != fy) pre[fx] =  fy;
}
int main() {
//  freopen("input.txt", "r", stdin);
//  freopen("output.txt", "w", stdout);
    int n, m;
    scanf("%d%d", &n, &m);
    make_set(n);
    while(m--){
        int u, v, w;
        scanf("%d%d%d", &u, &v, &w);
        addEdge(u, v, w);
    }
    int s, t;
    scanf("%d%d", &s, &t);
    sort(edge, edge + cnt);
    int maxv;
    for(int i = 0; i < cnt; ++i){
        int u = edge[i].u, v = edge[i].v;
        if((u == s && v == t) || (u == t && v == s)){
            union_set(u, v);
            maxv = edge[i].w;
            break;
        }
    }
    int cur = 1;
    for(int i = 0; i < cnt; ++i){
        int u = edge[i].u, v = edge[i].v, w = edge[i].w;
        if(find_set(u) != find_set(v)){
            union_set(u, v);
            maxv = max(maxv, w);
            ++cur;
            if(cur == n - 1) break;
        }
    }
    printf("%d %d\n", n - 1, maxv);
    return 0;
}