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 |
这个题虽然是搜索做,但是用的是拆点然后找割边的思想做的.In Reply To:这个问题用最大网络流可以吗?那会有环流吧,难道用最小费用最大流? Posted by:MetalHeart at 2008-05-15 16:11:11 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator