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:最小点权覆盖?In Reply To:最小点权覆盖? Posted by:wolf5x at 2009-02-23 18:45:49 > 转化成匹配的网络流解法,求最小割,编号为i的点权值是2^i Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator