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

Re:感觉陈启峰的那篇论文里的解法的时间复杂度不止O(n^2)。

Posted by qq872191552 at 2017-01-03 08:50:53 on Problem 2152
In Reply To:感觉陈启峰的那篇论文里的解法的时间复杂度不止O(n^2)。 Posted by:trfhjkl456789 at 2011-10-03 19:36:06
的确是O(n^2)的
每个点只会在它自己和它的父亲处被枚举n次

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