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

Bellman-Ford，求一次最短路，再判一次负环就可以了

Posted by xiaomi at 2004-09-30 16:31:08 on Problem 1860
In Reply To:这题不知用什么算法，过了的说一下．这题数据好像有点弱，把循环次数从N改为10*N就过了 Posted by:windbells at 2004-09-30 15:25:13 
>
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