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

难到可以改成nlogn的？如果能我努力试试改改。

Posted by speedfirst at 2005-08-13 12:45:47
In Reply To:才发现这个题的算法复杂度是O(n^2)的 Posted by:c0500448242 at 2005-08-13 12:41:20 
对啊，我一直在努力让n^2前的那个系数小一些。
难道可以改成nlogn的？有什么好思路呢？
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