并查集
关注
分享
扫一扫
文章平均质量分 85
Oenheng
没有遗憾的人生是不完美的
展开
-
Networking（最小生成树）
NetworkingTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionYou are assigned to design network connections between certain points in a wide area. You原创 2016-08-04 11:25:22 · 248 阅读 · 0 评论 -
More is better（简单并查集）
More is betterTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 24367 Accepted Submission(s): 8746Problem DescriptionMr Wang原创 2016-08-01 19:53:39 · 386 阅读 · 0 评论 -
Ice_cream's world I（并查集找环）
Ice_cream's world ITime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionice_cream's world is a rich country, it has many fertile land原创 2016-08-01 21:18:46 · 367 阅读 · 0 评论 -
畅通工程（模板）（并查集）
畅通工程Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一原创 2016-08-01 20:00:58 · 248 阅读 · 0 评论 -
New Year Permutation
B - New Year PermutationTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionUser ainta has a permutation p1, p2, ..., pn. As the Ne原创 2016-09-23 23:54:54 · 271 阅读 · 0 评论