```
int merge(int x,int y)
{
int fax=gf(x);
int fay=gf(y);
d[fax]+=n[fay];
n[fay]+=n[fax];
n[fax]=0;
return f[fax]=fay;
}
```
@[xiaolou](/space/show?uid=68675) 帮我解释一下这个函数
by Inochi @ 2018-10-02 10:56:23
@[Memorium](/space/show?uid=67949)
这。。。难道不是合并吗。。。
d是到队首的距离，n是所在队的长度，f是father。。。
by xiaolou @ 2018-10-02 10:58:03
@[xiaolou](/space/show?uid=68675) https://www.luogu.org/blog/juruohyfhaha/bing-zha-ji-xue-xi-zong-jie
看我的blog吧~~（宣传一下）~~
by hyfhaha @ 2018-10-02 11:03:34
@[hyfhaha](/space/show?uid=58711) 看了一遍好像还是没看出来哪里错了。。。
by xiaolou @ 2018-10-02 11:06:31
@[xiaolou](/space/show?uid=68675) 听课！
by shiys2007 @ 2018-10-02 11:12:24
@[shiys2007](/space/show?uid=65515) 听课！
by xiaolou @ 2018-10-02 11:13:17