Detail of message

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

按照x坐标排序，每次找最左边那个未覆盖的点，使得连续覆盖的点最多?

Posted by cscjzz at 2005-08-05 20:38:10 on Problem 1328
In Reply To:就是贪心 Posted by:T3 at 2005-08-05 20:33:05

Followed by:

我记得是转化成区间，然后从前到后让尽量多的区间相交 (0) frkstyc 2005-08-05 20:41:49
- Re:不需要用二分匹配？ (0) queyue2004 2005-08-05 22:01:55
  - 发错地方了！ (0) queyue2004 2005-08-05 22:02:21
- Re:我记得是转化成区间，然后从前到后让尽量多的区间相交 (23) Huacm56 2006-07-25 15:35:22
Re:按照x坐标排序，每次找最左边那个未覆盖的点，使得连续覆盖的点最多? (57) zxqi_009 2005-09-07 15:23:11
- Re:按照x坐标排序，每次找最左边那个未覆盖的点，使得连续覆盖的点最多? (86) pillar 2006-07-11 16:38:11
  - Re:按照x坐标排序，每次找最左边那个未覆盖的点，使得连续覆盖的点最多? (42) bobobo 2006-08-14 01:06:08
    - bobobo按区间排序,有重叠部分的就可以被一个radar覆盖到，贪心 (35) sza 2006-08-14 11:47:06
      - T_T 太菜了，浮点数判断的错误WA了n次才检查出来。。 (39) Acsaga 2006-11-30 17:22:42
      - Re:bobobo按区间排序,有重叠部分的就可以被一个radar覆盖到，贪心 (1542) 0506010237 2007-06-12 18:14:15
  - Re:按照x坐标排序，每次找最左边那个未覆盖的点，使得连续覆盖的点最多? (54) test_acm 2008-08-12 21:26:34

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator