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

那每一对BX是单独考虑吗,不需要考虑其他箱子的阻碍?(晕,重发一遍)

Posted by Luffy at 2005-08-07 14:35:32
In Reply To:每一对BX的最短路做权,求所有B和所有X的最优匹配 Posted by:frkstyc at 2005-08-07 14:17:51


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