HDU ACM Steps 5.3 - 随笔分类 - cssystem

5.3.4 Connections between cities

摘要：Connections between citiesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 444 Accepted Submission(s): 142 Problem Description After World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. Ho... 阅读全文

posted @ 2013-04-26 22:38 cssystem 阅读(125) 评论(0) 推荐(0)

5.3.7 Increasing Speed Limits （树状数组）（UNSOLVED）

摘要：Increasing Speed LimitsTime Limit: 2000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 101 Accepted Submission(s): 46 Problem Description You were driving along a highway when you got caught by the road police for speeding. It turns out that the... 阅读全文

posted @ 2013-03-31 23:40 cssystem 阅读(123) 评论(0) 推荐(0)

5.3.5 Interviewe （错误的二分，RMQ）（UNSOLVED）

摘要：IntervieweTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 528 Accepted Submission(s): 134 Problem Description YaoYao has a company and he wants to employ m people recently. Since his company is so famous, there are n people coming... 阅读全文

posted @ 2013-03-31 23:37 cssystem 阅读(239) 评论(0) 推荐(0)

5.3.1 See you~ （二维树状数组）（UNSOLVED）

摘要：See you~Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 144 Accepted Submission(s): 47 Problem Description Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and... 阅读全文

posted @ 2013-03-31 23:36 cssystem 阅读(156) 评论(0) 推荐(0)

5.3.6 Cow Sorting （HDU 及 POJ）

摘要：Cow SortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 67 Accepted Submission(s): 35 Problem Description Sherlock's N (1 ≤ N ≤ 100,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in... 阅读全文

posted @ 2013-03-24 10:37 cssystem 阅读(230) 评论(0) 推荐(0)

5.3.3 敌兵布阵

摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 199 Accepted Submission(s): 123 Problem Description C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国... 阅读全文

posted @ 2013-03-24 10:31 cssystem 阅读(169) 评论(0) 推荐(0)

随笔分类 - HDU ACM Steps 5.3