 |
| ||||
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:找最长路不要用BellmanFord 用SPFAIn Reply To:Re:找最长路不要用BellmanFord 用SPFA Posted by:CPP at 2007-10-08 09:00:15 O(km)乃是某些人想象而得 > 对啊，我就是使用SPFA啦,一样还是超时.SPFA找路的复杂度是多少？听说大概是O(km)??这道题还要注意那些地方？谢谢啦 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
