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

为什么Post office加四边形不等式后时间复杂度为O(n^2),而非O(n*p)?求指点。

Posted by inowfordream at 2010-07-14 16:34:31 on Problem 1160
In Reply To:n^2找中点算min_cost n^2四边形算DP 总的O(n^2) Posted by:__XiO at 2010-07-08 21:50:27


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