网站介绍:文章浏览阅读90次。#include &lt;cstdio&gt;#include &lt;cstdlib&gt;#include &lt;iostream&gt;#include &lt;algorithm&gt;#include &lt;string&gt;#include &lt;cstring&gt;#include &lt;vector&gt;#include &lt;queue&a_void init() { for(int i=1;i<=n;i++) { father[i]=isize[i]=1; } } int find(
- 链接地址:https://blog.csdn.net/cry_admin/article/details/79535072
- 链接标题:1107. Social Clusters (30)--查并集_void init() { for(int i=1;i<=n;i++) { father[i]=is-CSDN博客
- 所属网站:blog.csdn.net
- 被收藏次数:5567
- 网站标签:void init() { for(int i=1;i<=n;i++) { father[i]=isize[i]=1; } } int find(