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

in

Posted by wywcgs at 2006-08-01 19:04:53 on Problem 2906
In Reply To:这题贪心怎么做？？ Posted by:xiaolonghingis at 2006-08-01 19:02:25 
对工作起始点排序，将结束时间push近一个最大堆，每次pop m/2个
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