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:seol at 2006-05-16 12:54:52 > 将边与正方形都视为结点,看成二分图(还是叫二部图?偶不知道) > 然后在边所构成的结点集合中求最小割,转化为简单的图论问题. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator