并查集 - 随笔分类(第2页) - Blackops

HDU——1213How Many Tables（并查集按秩合并）

摘要：J - How Many Tables Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u J - How Many Tables Description Today is Ignatius' birthday. 阅读全文

posted @ 2016-05-21 09:46 Blackops 阅读(155) 评论(0) 推荐(0)

HDU——1233还是畅通工程（克鲁斯卡尔+优先队列）

摘要：还是畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 38031 Accepted Submission(s): 17161 Probl 阅读全文

posted @ 2016-05-20 19:19 Blackops 阅读(191) 评论(0) 推荐(0)

ACM程序设计选修课——Problem E:(ds:图)公路村村通（优先队列或sort+克鲁斯卡尔+并查集优化）

摘要：畅通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 24323 Accepted Submission(s): 10621 Problem 阅读全文

posted @ 2016-05-19 21:44 Blackops 阅读(416) 评论(0) 推荐(0)

POJ——1611The Suspects（启发式并查集+邻接表）

摘要：The Suspects Time Limit: 1000MS Memory Limit: 20000K Total Submissions: 31100 Accepted: 15110 Description Severe acute respiratory syndrome (SARS), an 阅读全文

posted @ 2016-05-12 19:55 Blackops 阅读(310) 评论(0) 推荐(0)

Blackops

随笔分类 - 并查集

公告