Program D--贪心-区间覆盖
摘要:
Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cov... 阅读全文
posted @ 2015-08-09 20:42 x心有灵犀 阅读(108) 评论(0) 推荐(0) 编辑