Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

我记得是转化成区间,然后从前到后让尽量多的区间相交

Posted by frkstyc at 2005-08-05 20:41:49 on Problem 1328
In Reply To:按照x坐标排序,每次找最左边那个未覆盖的点,使得连续覆盖的点最多? Posted by:cscjzz at 2005-08-05 20:38:10


Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


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