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

找到环后是不是还要扫一遍环? 这样做是不是最坏情况下是O(N*Q)的?

Posted by sillybird at 2008-10-02 17:02:35
In Reply To:写了个1005的解题报告，想看的可以看看 Posted by:lynncui at 2008-09-29 19:55:57 
是不是找了LCA后, 在环内的那些点都要扫一遍?  

感觉算法很显然, 不明白是不是什么地方做了很大的优化?
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