2015年5月19日
uva.10020 Minimal coverage(贪心）
摘要： 10020Given several segments of line (int the X axis) with coordinates [Li, Ri]. You are to choose the minimalamount of them, such they would completel... 阅读全文
posted @ 2015-05-19 17:35 92度的苍蓝 阅读(280) 评论(0) 推荐(0) 编辑
Hdu.1325.Is It A Tree?(并查集）
摘要： Is It A Tree?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16702Accepted Submission(s): 3761 Pr... 阅读全文
posted @ 2015-05-19 17:33 92度的苍蓝 阅读(181) 评论(0) 推荐(0) 编辑
http://images.cnblogs.com/cnblogs_com/Running-Time/724426/o_b74124f376fc157f352acc88.jpg