2017年6月24日

activity select problem(greedy algorithms)

摘要： many activities will use the same place, every activity ai has its' start time si and finish time fi.let the number of activities to be as many as pos 阅读全文

posted @ 2017-06-24 14:01 Wujunde 阅读(210) 评论(0) 推荐(0) 编辑