11 2024 档案

【模板】最小生成树-kruskal
摘要：int father[5010], n, m; int find(int x)//找根函数，记得进行路径压缩 { if(father[x] == x) return x; else return father[x] = find(father[x]); } int same(int x, int y 阅读全文
posted @ 2024-11-16 19:46 joylz 阅读(17) 评论(0) 推荐(0)