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:按照x坐标排序,每次找最左边那个未覆盖的点,使得连续覆盖的点最多?In Reply To:按照x坐标排序,每次找最左边那个未覆盖的点,使得连续覆盖的点最多? Posted by:cscjzz at 2005-08-05 20:38:10 是贪心阿。不过不是按x坐标排序把,我是按照每个点对应的圆心(点在圆上,圆心在点右侧)的x坐标排序的。ac了。嘻嘻。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator