[枚举最小瓶颈生成树]UVa-1395 - Slim Span(kruskal)

就是紫书的思路，像暴力

#include
using namespace std;
const int MAXN = 105;
const int INF = 0x3f3f3f3f;
struct Edge{
    int u,v,cost;
    bool operator < (const Edge& a)const {
        return cost > a.cost;
    }
};
vector edges;
int n,m;
int F[MAXN];
int find_(int x){
    return x==F[x]?x:F[x]=find_(F[x]);
}
int kruskal(int k){
    for(int i=0;i<=n;i++) F[i]=i;
    int cnt=0;
    int minn=INF,maxn=0;
    for(int i=k;i