 |
| ||||
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 | |||||||||
问一个非常弱的网络流问题
《建国大业》有A个观众，B个演员。每个观众j有一个喜欢演员的集合 L_j = { ...一群演员... }， 请一个演员i花费b_i 元， 一个观众j如果看到他喜欢的所有演员，付 a_j 元。
要求找一个方案使得利润最大。。
谢谢了！
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
