递归有路径压缩
by ez_lcw @ 2021-04-16 22:07:51
你这个没有压缩
by _caiji_ @ 2021-04-16 22:09:15
循环你可以搞个栈把经过的点压到根要不复杂度不对
by iMya_nlgau @ 2021-04-16 22:20:07
您这样没有路径压缩，我一般这样写
```cpp
m = fa[m] = fa[fa[m]];
```
by _Emiria_ @ 2021-04-16 22:24:41
递归有路径压缩，你写的这种循环做不到
by Aw顿顿 @ 2021-04-16 22:24:59
@[蒟蒻且网抑fks](/user/287868) 这复杂度也不太对吧
by lcyxds @ 2021-04-16 23:21:34
@[lcyxds](/user/124314) [非递归](https://www.luogu.com.cn/record/49585989)
[递归](https://www.luogu.com.cn/record/49585976)
by _Emiria_ @ 2021-04-16 23:31:30
循环用路径对折，复杂度一样的，看Tarjan论文
by hly1204 @ 2021-04-17 00:37:01