Zerohcl的博客

HDU-1213 #include <iostream> #include <algorithm> using namespace std; const int N = 1000; int par[N], Rank[N], num[N]; void init(int n) { for (int i = 1; i <= n; ++i) { par[i] = i; Rank[i] = 0; } } int find(int i)

POJ-1611 #include <iostream> using namespace std; const int maxx = 30000; int par[maxx], Ran[maxx]; void init(int n) { for (int i = 0; i < n; i++) { par[i] = i; Ran[i] = 0; } } int find(int x) { if (par[x] == x)retur