Disjoint Set: Union Find Tree Aizu - DSL_1_A
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAX = 10005;
int pre[MAX];
int Find(int x){
return (pre[x] == x) ? x : Find(pre[...
原创
2018-12-09 22:44:39 ·
183 阅读 ·
0 评论