摘要：题目链接：http://acm.buaa.edu.cn/problem/418/代码：#include#include#include#includeusing namespace std;const int maxn = 550;const int maxe = 5050;const int INF = 0x3f3f3f3f;int pa[maxn];int find(int x){ return x == pa[x] ? x : pa[x] = find(pa[x]);}struct Edge{ int u,v,w; bool operator rhs.w; }}... 阅读全文

摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4750代码：#include#include#include#includeusing namespace std;const int maxn = 10005;const int maxm = 500500;struct Edge{ int u,v,w; Edge(int u=0,int v=0,int w=0): u(u), v(v), w(w) {} bool operator >n>>m) { for(int i=0; i<n; i++) ... 阅读全文

摘要：题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4882代码：#include#include#include#include#includeusing namespace std;const int maxn = 200005;struct Edge{ int u,v,w; Edge(int u=0,int v=0,int w=0): u(u), v(v), w(w) {} bool operator rhs.w; }}edges[maxn];int counts[maxn];int p... 阅读全文

摘要：题目链接：http://poj.org/problem?id=1611#include #include #include #include #include #include #include #define maxn 30050#define INF 0x3f3f3fusing namespace std;int pa[maxn]; int find(int x){ return x == pa[x] ? x : pa[x] = find(pa[x]);}int main(){ int n,m; while(scanf("%d%d",&n,&m)){ . 阅读全文