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

dist[] 初始化为0,一开始所有点进栈,用栈实现SPFA求负环 266MS

Posted by yyii1111 at 2012-02-15 09:13:24 on Problem 3621
dist[] 初始化为0,一开始所有点进栈,用栈实现SPFA求负环 266MS
……总之我用栈实现是AC的……
不知道那些用栈TLE的是怎么写的……

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