随笔分类 -  。。。二分||三分

上一页 1 2
Color the ball(树状数组+线段树+二分)
摘要：Color the ballTime Limit : 9000/3000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3Accepted Submission(s) : 1Problem De... 阅读全文
posted @ 2015-10-27 21:39 handsomecui 阅读(432) 评论(0) 推荐(0) 编辑
Shot（三分）
摘要：ShotTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1053Accepted Submission(s): 590Problem Descrip... 阅读全文
posted @ 2015-10-27 16:53 handsomecui 阅读(307) 评论(0) 推荐(0) 编辑
xmu1125 越野车大赛(三分)
摘要：1125: 越野车大赛Time Limit: 500 MSMemory Limit: 64 MBSpecial JudgeSubmit: 4Solved: 3[Submit][Status][Web Board]Description TheBeet正在参加一场越野车大赛。比赛的场地如右图： 共... 阅读全文
posted @ 2015-10-08 13:42 handsomecui 阅读(307) 评论(4) 推荐(0) 编辑
Light Bulb（三分）
摘要：ZOJ Problem Set - 3203Light BulbTime Limit: 1 Second Memory Limit: 32768 KBCompared to wildleopard's wealthiness, his brother mildleopard is rather p... 阅读全文
posted @ 2015-10-08 12:49 handsomecui 阅读(333) 评论(0) 推荐(0) 编辑
Turn the corner (三分)
摘要：Turn the cornerTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 151 Accepted Submission(s): 61Prob... 阅读全文
posted @ 2015-10-08 11:56 handsomecui 阅读(462) 评论(0) 推荐(0) 编辑
xmu1214: 购物
摘要：1214: 购物Time Limit: 500 MSMemory Limit: 64 MBSubmit: 10Solved: 5[Submit][Status][Web Board]Description为了组织班级聚会，wlnwyyfc来到新华都购买一种物品，这类物品的价值为P。他身上有N笔款项，... 阅读全文
posted @ 2015-10-07 22:09 handsomecui 阅读(154) 评论(0) 推荐(0) 编辑
Babelfish(二分)
摘要：BabelfishTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 37238Accepted: 15879DescriptionYou have just moved from Waterloo to a big city. The ... 阅读全文
posted @ 2015-09-24 21:11 handsomecui 阅读(366) 评论(0) 推荐(0) 编辑
Trailing Zeroes (III)(lightoj 二分好题)
摘要：1138 - Trailing Zeroes (III)PDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBYou task is to find minimal natural numberN, so thatN!... 阅读全文
posted @ 2015-09-19 20:05 handsomecui 阅读(359) 评论(0) 推荐(0) 编辑
N种方法妙讲LIS算法
摘要：LIS算法经典汇总 假设存在一个序列d[1..9] = 2 1 5 3 6 4 8 9 7，可以看出来它的LIS长度为5。下面一步一步试着找出它。我们定义一个序列B，然后令 i = 1 to 9 逐个考察这个序列。此外，我们用一个变量Len来记录现在最长算到多少了首先，把d[1]有序地放到B里，令B 阅读全文
posted @ 2015-07-31 15:46 handsomecui 阅读(8419) 评论(38) 推荐(2) 编辑
Yougth的最大化（好题，二分查找 0 1分数规划）
摘要：Yougth的最大化时间限制：1000 ms | 内存限制：65535 KB 难度：4描述Yougth现在有n个物品的重量和价值分别是Wi和Vi，你能帮他从中选出k个物品使得单位重量的价值最大吗？输入有多组测试数据每组测试数据第一行有两个数n和k，接下来一行有n个数Wi和Vi。(1 2 #inclu... 阅读全文
posted @ 2015-07-30 21:33 handsomecui 阅读(666) 评论(0) 推荐(0) 编辑
Cable master（好题，二分）
摘要：Cable masterTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2473Accepted Submission(s): 922Problem... 阅读全文
posted @ 2015-07-30 16:19 handsomecui 阅读(595) 评论(0) 推荐(0) 编辑
Can you find it?(二分 二分+STL set map)
摘要：Can you find it? Problem Description Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can fi 阅读全文
posted @ 2015-07-30 13:45 handsomecui 阅读(226) 评论(0) 推荐(0) 编辑
Can you solve this equation?（二分）
摘要：Can you solve this equation?Time Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 61Accepted Submission(s... 阅读全文
posted @ 2015-07-30 12:36 handsomecui 阅读(520) 评论(0) 推荐(0) 编辑
Bridging signals（二分 二分+stl dp）
摘要：欢迎参加——每周六晚的BestCoder（有米！）Bridging signalsTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 941Accept... 阅读全文
posted @ 2015-07-30 11:35 handsomecui 阅读(307) 评论(0) 推荐(0) 编辑

上一页 1 2