 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:今天又知道，把残余网络中流量>0的边组成反图以方便从汇点出发dfs是没有必要的，因为可以直接从汇点出发dfs，只需要走e[ i^1 ].w > 0的边即可……In Reply To:终于知道求最小割边了~！~我应该没有理解错题意吧，求完一遍最大流后，从源点dfs遍历标记点vs[i]=1;然后扫描边，把流量>0的边组成反图后，再从汇点dfs遍历标记点vt[i]=1;再最后扫描边，所有容量为0的边如果其两端点分别被vs，vt标记那么cnt++; cnt即是答案。 Posted by:yuanchuanshun at 2012-07-02 21:30:44 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
