Detail of message

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

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

Posted by bupt003 at 2006-11-01 12:18:03 on Problem 3072
In Reply To:这个题目用bfs可以做吗？状态用二维数组来表示， p[from][now]：表示从now点到目标点的最优解（从from点过来的到now点，用于角度计算）？ Posted by:faen at 2006-10-31 23:03:53

Followed by:

Re:可以bfs，比dijkstra要快。二维数组best[a][b],表示当前在a点方向指向b点的最快到达时间。最后结果就是Min(best[n][i])(0<i<=n) (30) Iambitious 2006-11-01 13:58:49
- Re:可以bfs，比dijkstra要快。二维数组best[a][b],表示当前在a点方向指向b点的最快到达时间。最后结果就是Min(best[n][i])(0<i<=n) (37) bupt003 2006-11-01 14:04:09
  - Re:可以bfs，比dijkstra要快。二维数组best[a][b],表示当前在a点方向指向b点的最快到达时间。最后结果就是Min(best[n][i])(0<i<=n) (74) Iambitious 2006-11-01 14:45:57
  - 哦哦哦，应该就是这样，我的dijkstra就是0ms (41) wywcgs 2006-11-01 15:02:16

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator