Find non-overlap jobs with max cost
摘要：
Given a set of n jobs with [start time, end time, cost] find a subset so that no 2 jobs overlap and the cost is maximum.Job: （start_time, end_time] ... 阅读全文
posted @ 2015-04-03 15:15 Step-BY-Step 阅读(301) 评论(0) 推荐(0) 编辑
