| | | |

2015年8月7日

摘要： G - 贪心 Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status G - 贪心 Submit Status Description Simon and Garfunkel Corporation ( 阅读全文

posted @ 2015-08-07 20:00 竹林灯火阅读(307) 评论(0) 推荐(0)

高效算法——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 阅读全文

posted @ 2015-08-07 19:38 竹林灯火阅读(372) 评论(0) 推荐(0)

高效算法——C 分饼

摘要： My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F 阅读全文

posted @ 2015-08-07 18:50 竹林灯火阅读(343) 评论(0) 推荐(0)

高效算法——A 归并排序

摘要： In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacen 阅读全文

posted @ 2015-08-07 18:32 竹林灯火阅读(614) 评论(0) 推荐(0)