随笔分类 - 算法_强连通

HDU3594 强连通（仙人掌图）

摘要：Cactus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1907 Accepted Submission(s): 879 Problem D 阅读全文

posted @ 2017-01-30 11:23 luckilzy 阅读(412) 评论(0) 推荐(0) 编辑

HDU3072 强连通+最小树形图

摘要：Intelligence System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2534 Accepted Submission(s): 阅读全文

posted @ 2017-01-23 18:54 luckilzy 阅读(303) 评论(0) 推荐(0) 编辑

HDU3639 强连通

摘要：Hawk-and-Chicken Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2905 Accepted Submission(s): 895 阅读全文

posted @ 2017-01-23 12:58 luckilzy 阅读(358) 评论(0) 推荐(0) 编辑

有向图的强联通分量 Tarjan算法模板

摘要：//白书 321页 #include #include #include #include #include using namespace std; const int maxn=5003; vectorg[maxn];//g保存原始图 int pre[maxn],lowlink[maxn],sccno[maxn],dfs_clock,scc_cnt; //pre[u]为节点u的搜索次序编号；... 阅读全文

posted @ 2017-01-18 16:52 luckilzy 阅读(253) 评论(0) 推荐(0) 编辑