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^2); 较好的做法是旋转卡壳

Posted by ProgrammingEveryday at 2012-09-03 22:06:28 on Problem 2187
In Reply To:求大神帮忙看下,TLE啊,用扫描法求凸包,和别人的代码差不多,别人的代码跑110ms,我的却超时!!改了好多地方,还是这结果。这里附上我的代码和别人的代码。 Posted by:huronghai at 2012-08-30 10:31:37


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