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 |
bobobo按区间排序,有重叠部分的就可以被一个radar覆盖到,贪心In Reply To:Re:按照x坐标排序,每次找最左边那个未覆盖的点,使得连续覆盖的点最多? Posted by:bobobo at 2006-08-14 01:06:08 bobobo按区间排序,有重叠部分的就可以被一个radar覆盖到,贪心 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator