09 2016 档案

摘要:Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 18489 Accepted: 8558 Description Suppose that the fourth generation mobile ph 阅读全文
posted @ 2016-09-30 19:40 luckilzy 阅读(236) 评论(0) 推荐(0) 编辑
摘要:The kth great number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 10390 Accepted Submission(s) 阅读全文
posted @ 2016-09-29 22:28 luckilzy 阅读(243) 评论(0) 推荐(0) 编辑
摘要:转自:http://www.cnblogs.com/summerRQ/ 先回顾队列的定义:队列(queue)维护了一组对象,进入队列的对象被放置在尾部,下一个被取出的元素则取自队列的首部。priority_queue特别之处在于,允许用户为队列中存储的元素设置优先级。这种队列不是直接将新元素放置在队 阅读全文
posted @ 2016-09-29 22:18 luckilzy 阅读(359) 评论(0) 推荐(0) 编辑
摘要:S - 1019 Time Limit:1500MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice FZU 1894 S - 1019 Submit Status Practice FZU 1894 阅读全文
posted @ 2016-09-29 10:12 luckilzy 阅读(276) 评论(0) 推荐(0) 编辑
摘要:Sliding Window Time Limit: 12000MS Memory Limit: 65536K Total Submissions: 55309 Accepted: 15911 Case Time Limit: 5000MS Description An array of size 阅读全文
posted @ 2016-09-28 20:13 luckilzy 阅读(335) 评论(0) 推荐(0) 编辑
摘要:Necklace Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4604 Accepted Submission(s): 1581 Probl 阅读全文
posted @ 2016-09-27 19:43 luckilzy 阅读(584) 评论(0) 推荐(0) 编辑
摘要:Cube Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1956 Accepted Submission(s): 1017 Problem D 阅读全文
posted @ 2016-09-27 12:09 luckilzy 阅读(253) 评论(0) 推荐(0) 编辑
摘要:Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 25010 Accepted: 14745 Description Let S = s1 s2...s2n be a well-formed string 阅读全文
posted @ 2016-09-26 22:26 luckilzy 阅读(267) 评论(0) 推荐(0) 编辑
摘要:See you~ Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4729 Accepted Submission(s): 1515 Proble 阅读全文
posted @ 2016-09-20 20:10 luckilzy 阅读(375) 评论(0) 推荐(0) 编辑
摘要:敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 78691 Accepted Submission(s): 33255 Problem 阅读全文
posted @ 2016-09-17 22:14 luckilzy 阅读(366) 评论(0) 推荐(0) 编辑
摘要:A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 97196 Accepted: 30348 Case Time Limit: 2000MS Description Y 阅读全文
posted @ 2016-09-17 11:11 luckilzy 阅读(795) 评论(0) 推荐(0) 编辑
摘要:Flowers Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3148 Accepted Submission(s): 1549 Problem 阅读全文
posted @ 2016-09-16 20:23 luckilzy 阅读(619) 评论(0) 推荐(0) 编辑
摘要:转自 :http://blog.csdn.net/int64ago/article/details/7425727 我们先开始一起写一个二分吧,要求是对num[]= {1,2,2,4,4,8,10}不减序列在区间[0,7)进行查找,当然我们得首先保证要查找的数e满足:num[0] <= e <= n 阅读全文
posted @ 2016-09-06 20:47 luckilzy 阅读(270) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示