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

可是我刚才写的O(n)居然比原来暴力(最坏情况是n^2)的慢，ft ...

Posted by goastow at 2005-10-26 21:27:27 on Problem 2082
In Reply To:Re:这题怎么样N的复杂度做？ Posted by:goastow at 2005-10-26 21:22:47 
O(N) 172ms
暴力156MS

ft
数据太弱了？
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