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

log(n^2)=2logn...

Posted by frkstyc at 2006-08-02 16:49:54 on Problem 2785
In Reply To:O(n^2*logn)的时间复杂度怎么出来的?我只能O(n^2*log(n^2)) Posted by:snoopy at 2006-08-02 16:48:57 
> rt,跟这个题目杠了一天,错了不下15次了,前面TLE后面WA,用过Hash,有wa也有tle,改的自己认为没法再改后还是错,最朴素的想法tle,优化后wa(或者根本就是一个错的hash).
> 然后左右分开求和排序然后配对,不过好像我只能做到n^2*log(n^2),并且还WA了... >__< n^2*logn是先每个集合排序然后做加法?
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