强连通
粥粥同学
力大无穷,擅长搬运各种型号的服务器;推理大师,致力于各种网络故障排除;多才多艺,精通多种语言的“Hello World”。
展开
-
HDOJ--1269--迷宫城堡
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9310 Accepted Submission(s): 4158Problem Description为了训练小希的方向感,Gardon原创 2015-11-12 21:17:49 · 575 阅读 · 0 评论 -
HDOJ--3836--Equivalent Sets(tarjan算法)//求连接几个SCC最少的边
Equivalent SetsTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 3621 Accepted Submission(s): 1264Problem DescriptionTo prov原创 2015-11-21 20:49:21 · 499 阅读 · 0 评论 -
HDOJ--1827--Summer Holiday(强连通分量的最小代价连接)
Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2368 Accepted Submission(s): 1108Problem DescriptionTo see a W原创 2015-11-17 17:35:29 · 669 阅读 · 0 评论 -
HDOJ--2767--Proving Equivalences
Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3897 Accepted Submission(s): 1409Problem DescriptionC原创 2015-11-19 21:00:22 · 489 阅读 · 0 评论 -
poj 2553 The Bottom of a Graph 【有向图tarjan 求SCC 处理出度为0的SCC】
The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9429 Accepted: 3910DescriptionWe will use the following (standard) definiti原创 2015-11-28 21:29:24 · 376 阅读 · 0 评论