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 |
n-1次就可以了..In Reply To:Re:Bellman_ford吧?但是在每个点做次会不会太慢了? Posted by:huacm01 at 2007-08-30 14:56:48 > 是用bellmanford 只是增加一次迭代 如果第n次迭代都可以更新说明有负圈就是我们想求的 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator