随笔分类 -  图论 —— 生成树

摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2121 Ice_cream’s world II Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Othe 阅读全文

摘要：题目链接：https://vjudge.net/problem/HDU-4009 Transfer water Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submissi 阅读全文

摘要：题目链接：https://vjudge.net/problem/UVA-11183 You are part of a group of n teenage girls armed with cellphones. You have some news you want to tell everyo 阅读全文

摘要：题目链接：https://vjudge.net/problem/POJ-3164 Command Network Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 19079 Accepted: 5495 Description 阅读全文

摘要：题目链接：https://vjudge.net/problem/UVA-10462 Nasa, being the most talented programmer of his time, can’t think things to be so simple. Recently all his n 阅读全文

摘要：题目链接：https://vjudge.net/problem/UVA-10600 In order to prepare the “The First National ACM School Contest” (in 20??) the major of the city decided to p 阅读全文

摘要：题目链接：https://vjudge.net/problem/HDU-4081 Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java 阅读全文

摘要：题目链接：http://poj.org/problem?id=1679 The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 31378 Accepted: 11306 Description Given 阅读全文

摘要：题目链接：http://www.lydsy.com/JudgeOnline/problem.php?id=3732 Description 给你N个点的无向图 (1 <= N <= 15,000)，记为：1…N。 图中有M条边 (1 <= M <= 30,000) ，第j条边的长度为： d_j ( 阅读全文

摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1102 题解： 纯最小生成树，只是有些边已经确定了要加入生成树中，特殊处理一下这些边就可以了。 kruskal算法： 由于有些边已经确定，所以在调用kruskal()之前，就把这条边的两个顶点放在一个集合 阅读全文