 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:我承认，我抄的模板（吉林大学的） 最短距离枚举凸包的顶点In Reply To:我承认，我抄的模板（吉林大学的） 最短距离枚举凸包的顶点 Posted by:hehexiaobai at 2010-08-29 20:53:49 话说那个栈你写两次循环写繁了。 可以把基点也当作需加入点。最后求得的序列一定首尾都是基点，所以把TOP减1就可以了。只需要1遍循环。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
