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

所以就要用归并排序来求啦！

Posted by sEmPrmAjIa at 2006-07-28 23:49:09 on Problem 2299
In Reply To:Re:为什么这题要配一个厕所的捅捅的插图啊? ^_^ Posted by:houxuanfelix at 2006-07-28 20:54:57 
> 你对所给的序列来一个冒泡排序，比较一下要交换的次数，就ok 了，题目实际上就是要求一个冒泡排序需要交换的次数，但是O(n*n)的时间是会TLE的，所以你要设法降低时间复杂度
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