 |
| ||||
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:问一个非常弱的网络流问题In Reply To:Re:问一个非常弱的网络流问题 Posted by:hhb_maid at 2009-11-15 12:46:31 > 最大权闭合图： > S到所有观众连边，容量a_j,每个演员到t连边-b_i，每个观众到他喜欢的所有演员都连正无穷容量的边，答案就是sum(a_j)-Mincut 谢谢大侠，能不能具体讲讲为什么啊 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
