随笔分类 -  图--连通图

摘要:题目链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=120思路:先将原图强连通缩点为新图,统计新图中入度,出度为0的点的个数,两者取最大值即为答案。代码如下:#include "stdio.h"#include "string.h"#inclu... 阅读全文
posted @ 2014-05-22 10:39 ruo_yu 阅读(235) 评论(0) 推荐(0)
摘要:1451: Semiconnected时间限制:1 Sec内存限制:32 MB提交:79解决:20题目描述For a directed graph G = (V, E), if for all pairs of nodes u,v, u can always reach v or v can alw... 阅读全文
posted @ 2014-05-19 08:19 ruo_yu 阅读(275) 评论(0) 推荐(0)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4635题意:给你一个n个点m条边的图,问在图不是强连通图的情况下,最多可以向图中添多少条边,若图为原来就是强连通图,输出-1即可;思路:最后得到的图肯定分为两部分x和y,且两部分均为强连通分量,要么x的点... 阅读全文
posted @ 2014-05-06 16:55 ruo_yu 阅读(331) 评论(0) 推荐(0)
摘要:题目链接:http://poj.org/problem?id=3694题意:n个点,m条边,给你一个连通图,然后有Q次操作,每次加入一条边(A,B),加入边后,问当前还有多少桥,输出桥的个数。解题思路:先将原连通图边双连通缩点成一颗树,Q次操作过程中对树进行LCA操作。具体看代码:看网上也有不缩点的... 阅读全文
posted @ 2014-05-06 09:15 ruo_yu 阅读(192) 评论(0) 推荐(0)
摘要:题目链接:http://poj.org/problem?id=3177边双连通问题,与点双连通还是有区别的!!!题意是给你一个图(本来是连通的),问你需要加多少边,使任意两点间,都有两条边不重复的路径;先将所有的边双连通分量看做一个点,此时的图就变成了一棵树,则题目变成了在树种添一些边,使任意两点间... 阅读全文
posted @ 2014-05-05 17:30 ruo_yu 阅读(224) 评论(0) 推荐(0)
摘要:Warm upTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3160Accepted Submission(s): 718Problem Des... 阅读全文
posted @ 2014-05-04 21:16 ruo_yu 阅读(245) 评论(0) 推荐(0)
摘要:Knights of the Round TableTime Limit:7000MSMemory Limit:65536KTotal Submissions:9169Accepted:2960DescriptionBeing a knight is a very attractive career... 阅读全文
posted @ 2014-05-04 14:37 ruo_yu 阅读(277) 评论(0) 推荐(0)
摘要:Caocao's BridgesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1231Accepted Submission(s): 478Pro... 阅读全文
posted @ 2014-04-28 11:06 ruo_yu 阅读(292) 评论(0) 推荐(0)
摘要:NetworkTime Limit:1000MSMemory Limit:10000KTotal Submissions:8797Accepted:4116DescriptionA Telephone Line Company (TLC) is establishing a new telephon... 阅读全文
posted @ 2014-04-26 21:18 ruo_yu 阅读(163) 评论(0) 推荐(0)