并查集
旺旺_碎_冰冰
这个作者很懒,什么都没留下…
展开
-
并查集三道入门题
题目描述 Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each原创 2018-01-09 21:39:10 · 571 阅读 · 2 评论 -
2018年全国多校算法寒假训练营练习比赛(第五场):D 集合问题(并查集)
链接:https://www.nowcoder.com/acm/contest/77/D 来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 给你a,b和n个数p[i],问你如何分配这n个数给A,B集合,并且满足: 若x在集合A中,则a原创 2018-02-27 17:32:08 · 232 阅读 · 0 评论 -
Conscription POJ - 3723(最小生成树)
Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier without any privilege原创 2018-04-07 20:13:59 · 215 阅读 · 0 评论