Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
枚举不是最佳选择, 时间复杂度为O(n^2); 较好的做法是旋转卡壳In Reply To:求大神帮忙看下,TLE啊,用扫描法求凸包,和别人的代码差不多,别人的代码跑110ms,我的却超时!!改了好多地方,还是这结果。这里附上我的代码和别人的代码。 Posted by:huronghai at 2012-08-30 10:31:37 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator