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:可以bfs，比dijkstra要快。二维数组best[a][b],表示当前在a点方向指向b点的最快到达时间。最后结果就是Min(best[n][i])(0<i<=n)

Posted by Iambitious at 2006-11-01 13:58:49 on Problem 3072
In Reply To:可以bfs，比dijkstra要快。二维数组best[a][b],表示当前在a点方向指向b点的最快到达时间。最后结果就是Min(best[n][i])(0<i<=n) Posted by:bupt003 at 2006-11-01 12:18:03 
哦?两种方法我都做了,bfs 1900+,dij 230+。
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