![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
强联通双联通分量
文章平均质量分 78
进修中的涵涵涵
acm退役选手
acm icpc 金
dota爱好者
展开
-
HDU - 3836 Equivalent Sets(强联通分量)
Equivalent SetsTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 4781 Accepted Submission(s): 1720Problem DescriptionTo prov原创 2017-08-14 01:35:43 · 390 阅读 · 0 评论 -
HDU - 3861 The King’s Problem(强联通分量+最小路径覆盖)
The King’s ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3156 Accepted Submission(s): 1111Problem DescriptionIn the原创 2017-08-14 03:24:41 · 504 阅读 · 0 评论 -
HDU - 3594 Cactus (强联通判断仙人掌树)
CactusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2194 Accepted Submission(s): 1034Problem Description1. It is a Strongly原创 2017-09-21 23:56:34 · 457 阅读 · 0 评论