![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
并查集专题
lansetiankong_yiyi
这个作者很懒,什么都没留下…
展开
-
HDU 1232畅通工程两种方法(dfs),(并查集)
畅通工程<br />Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 8777 Accepted Submission(s): 4370<br /><br />Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交原创 2010-08-16 07:55:00 · 413 阅读 · 0 评论 -
PKU 1988 并查集
Cube StackingTime Limit: 2000MSMemory Limit: 30000KTotal Submissions: 10123Accepted: 3365Case Time Limit: 1000MS<br />DescriptionFarmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks原创 2010-08-21 09:22:00 · 560 阅读 · 0 评论