kruskal 10分求救

P3366 【模板】最小生成树

for(int i=1; i<=n; i++){ int f1=find(e[i].x); int f2=find(e[i].y); 把这里的n改成m
by xiaofulll @ 2019-08-16 16:54:03


是滴
by 逆时针的记忆 @ 2019-08-16 16:58:34


@[xiaofulll](/space/show?uid=123572) 谢谢~
by xingzi @ 2019-08-16 16:58:50


|