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

我觉得理论上是n2的不过我写得很烦每次都要比较答案,然后每次其实都有个O(n)的清零,还有求gcd

Posted by xiaxia at 2006-03-27 14:07:38 on Problem 2780
In Reply To:我觉得解题报告说的算法都是O(n^2lgn)的,包括用hash的 Posted by:frkstyc at 2006-03-27 12:48:13
导致o(n2)到了1000多ms 而n2logn的 用g++竟然刷到421ms g++比c++快很多啊。
g++ 还是不错的阿

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