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)

Posted by cai0715 at 2009-06-03 11:30:48 on Problem 3017 and last updated at 2009-06-03 11:31:00
In Reply To:如果数据是递减的,而且所有数之和不大于M,则复杂度会退化为O(N^2) Posted by:ACman at 2008-05-05 16:48:28
RT

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