2015年11月3日
线性结构3 Pop Sequence（PAT）
摘要： Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a... 阅读全文
posted @ 2015-11-03 22:59 编程菌 阅读(276) 评论(0) 推荐(0)
HDU 1574 RP问题(DP)
摘要： 题目链接 ：HDU 1574 RP问题 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 925 Accepted Submi... 阅读全文
posted @ 2015-11-03 10:41 编程菌 阅读(296) 评论(0) 推荐(0)