摘要: 最小生成树 kruskal #include <bits/stdc++.h> #define ll long long using namespace std; const ll N=2e5+10; ll n,m,f[N],l,cnt,ans; struct line{ ll x,y,l; }li[ 阅读全文
posted @ 2022-07-13 14:33 KevinLikesCoding 阅读(58) 评论(0) 推荐(0)