![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
强联通
文章平均质量分 80
fcbruce
Veni,Vidi,Vici
展开
-
ZOJ 3795 Grouping(强联通缩点,记忆化搜索)
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3795原创 2014-07-01 21:42:07 · 796 阅读 · 0 评论 -
HDU 2767 Proving Equivalences (强联通)
http://acm.hdu.edu.cn/showproblem.php?pid=2767Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2926 Accepted Sub原创 2014-07-10 22:07:57 · 1056 阅读 · 0 评论 -
POJ 2186 Popular Cows (强联通)
http://poj.org/problem?id=2186Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 23819 Accepted: 9767DescriptionEvery cow's dream原创 2014-10-14 15:20:03 · 1142 阅读 · 0 评论 -
POJ 2762 Going from u to v or from v to u?(强联通,拓扑排序)
http://poj.org/problem?id=2762Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14573 Accepted: 3849Description原创 2014-10-14 15:30:13 · 1134 阅读 · 0 评论