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

floyd + 最小路径覆盖！！！

Posted by Jsky at 2009-10-21 16:23:23 on Problem 2594 
   由于图中的点可以重复的走，所有先用floyd建新图。而图中点最多为500，floyd时间复杂度为 n^3，竟然没超时。感觉数据太弱了！
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