Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

第100题留念。。附上微型题解。。

Posted by pkqs90 at 2011-05-27 02:15:47 on Problem 2987 
是道最大权闭合子图，不过关键在于求最少的删除数。。

所以我们这么做，从起点开始dfs，把有残余流量的边dfs到。。最后答案就是遍历的点数（除S）

这么做之所以是对的，是因为S所在集合是“删除点的集合”，而最小割则是这个集合的“终点”。。
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator