 |
| ||||
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 | |||||||||
Re:可以bfs，比dijkstra要快。二维数组best[a][b],表示当前在a点方向指向b点的最快到达时间。最后结果就是Min(best[n][i])(0<i<=n)In Reply To:Re:可以bfs，比dijkstra要快。二维数组best[a][b],表示当前在a点方向指向b点的最快到达时间。最后结果就是Min(best[n][i])(0<i<=n) Posted by:bupt003 at 2006-11-01 14:04:09 > 我也两种都做了，bfs 15ms，dij 300+。。可能dij方法不同吧 恩，应该是这个原因，我用的java。也有可能我bfs写的烂，呵呵。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
