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

那样子复杂度不是更高么？nq回答是怎么操作？

Posted by lijunle at 2012-05-09 20:43:14 on Problem 4046
In Reply To:Re:无限TLE，不是O(n^2*logn)的处理，询问O(1)做法？ Posted by:totalfrank at 2012-05-09 18:54:24 
> 可以nm处理,nq回答
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