求dalao查错QAQ

P3367 【模板】并查集

~~while(1)~~
by Shan_Xian @ 2016-12-21 13:07:05


~~呵呵~~
by 6QWQ6 @ 2017-03-08 14:17:17


```cpp int find(int i){//找父节点操作 if(i==father[i])return i; while(i!=father[i])i=father[i]; return father[i]; } void unionn(int i,int j){//合并操作 int r1=find(i),r2=find(j); if(r1==r2)return; father[r2]=r1; father[j]=r1; return; } 希望对您有帮助! ```
by Lyrics @ 2017-07-23 15:13:24


|