Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:问一个非常弱的网络流问题

Posted by hhb_maid at 2009-11-15 12:46:31 and last updated at 2009-11-15 12:50:16
In Reply To:问一个非常弱的网络流问题 Posted by:usfish at 2009-11-15 12:30:25 
> 
> 《建国大业》有A个观众，B个演员。每个观众j有一个喜欢演员的集合 L_j = { ...一群演员... }， 请一个演员i花费b_i 元， 一个观众j如果看到他喜欢的所有演员，付 a_j 元。 
> 
> 要求找一个方案使得利润最大。。
> 
> 谢谢了！ 
最大权闭合图：
S到所有观众连边，容量a_j,每个演员到t连边-b_i，每个观众到他喜欢的所有演员都连正无穷容量的边，答案就是sum(a_j)-Mincut
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator