摘要： A - 最大子段和 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status A - 最大子段和 Submit Status Description Given a sequence a[1] 阅读全文

摘要： In an open credit system, the students can choose any course they like, but there is a problem. Some of the students are more senior than other studen 阅读全文

摘要： 恢复内容开始 J - 中途相遇法 Time Limit:9000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status J - 中途相遇法 Submit Status Description The SUM problem can 阅读全文

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

摘要： 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 阅读全文

摘要： 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 阅读全文

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

摘要： H - 贪心 Crawling in process... Crawling failed Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Description Des 阅读全文

摘要： E - 贪心-- 区间覆盖 题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=85904#problem/E 解题思路： 贪心思想，将问题转化为区间覆盖问题，将草地的上边界作为要覆盖的区间，计算出每个洒水器覆盖的区间范围，不能覆盖的 阅读全文

摘要： Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Submit Status Description A set of n<tex2html_verbatim_mark> 1-dimensiona 阅读全文