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 ACM06060 at 2007-02-11 20:46:34 on Problem 1002
In Reply To:我看阁下太过于浮躁,不适合做acm,不要在这上面浪费太多时间,以免后悔莫及 Posted by:Sempr at 2007-02-11 18:43:51
> 这个题目的数据范围有100,000,你用冒泡排序的做法是肯定不行的
> 应该用复杂度为O(NlogN)高级的排序算法
> 自己去查查书吧!

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