随笔分类 -  ...图论~强联通&&双联通

Proving Equivalences（加多少边使其强联通）
摘要：Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4384Accepted Submission(s): 15... 阅读全文
posted @ 2015-10-28 22:12 handsomecui 阅读(672) 评论(0) 推荐(0) 编辑
Network of Schools(强连通分量+缩点） （问添加几个点最少点是所有点连接+添加最少边使图强连通)
摘要：Network of SchoolsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 13801Accepted: 5505DescriptionA number of schools are connected to a comput... 阅读全文
posted @ 2015-10-23 20:01 handsomecui 阅读(384) 评论(0) 推荐(0) 编辑
Summer Holiday(强联通入度最小点)
摘要：Summer HolidayTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2319Accepted Submission(s): 1082Pro... 阅读全文
posted @ 2015-10-21 20:16 handsomecui 阅读(250) 评论(0) 推荐(0) 编辑
迷宫城堡(强联通targin)
摘要：迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10409Accepted Submission(s): 4674Problem Descr... 阅读全文
posted @ 2015-10-21 17:42 handsomecui 阅读(652) 评论(0) 推荐(0) 编辑