摘要:题目链接:https://vjudge.net/problem/UVA-11324 题解: 题意:给出一张有向图,求一个结点数最大的结点集,使得任意两个结点u、v,要么u能到达v, 要么v能到达u(u和v也可以互相到达)。 1.可知在一个强连通分量中,任意两个点都可以互相到达。那么我们就对每个强连通
阅读全文
摘要:一.题目类型: 1.有向图的强连通分量: POJ1236 Network of Schools HDU1269 迷宫城堡 2.割点 & 割边: UESTC - 900 方老师炸弹 UVA315 Network UVA796 Critical Links HDU3394 Railway 3.无向图的边
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-3694 A network administrator manages a large network. The network consists of N computers and M links between pair
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-4738 A network administrator manages a large network. The network consists of N computers and M links between pair
阅读全文
摘要:题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=4612 Warm up Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Tot
阅读全文
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1269 迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submis
阅读全文
摘要:题目链接:http://poj.org/problem?id=3177 Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15852 Accepted: 6649 Description In ord
阅读全文
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3394 Railway Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Sub
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-796 In a computer network a link L, which interconnects two servers, is considered critical if there are at least
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-315 A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several plac
阅读全文
摘要:题目链接:http://poj.org/problem?id=1236 Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19859 Accepted: 7822 Description A n
阅读全文
摘要:题目链接:https://vjudge.net/problem/UESTC-900 方老师炸弹 方老师炸弹 Time Limit: 4000/2000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status 方老
阅读全文