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

我觉得就是2^N枚举一下起止金子点，然后每次求一个流量为N的最小费用流

Posted by RoBa at 2009-11-08 11:00:41 and last updated at 2009-11-08 11:08:00
In Reply To:D题题意 Posted by:RoBa at 2009-11-08 10:59:58 
> 一个有向图，其中有2N个点有金子，你要把这2N个点分给N个人，使得每人恰好有两个点，并且还可能需要把另外一些点分给某些人（一个点最多属于一个人），使得对于每个人来说，都可以从他的一个金子点到另一个金子点并且中途不经过属于其他人的点。
> 
> 每个点都有一个价值，现在要求找出一种分配方案满足条件并且使得不属于任何人的点的价值和最大。
> 
> (1 <= N <= 4, 1 <= V <= 500)
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