随笔分类 -  二分

POJ-2533最长上升子序列(DP+二分）（优化版）
摘要：Longest Ordered SubsequenceTime Limit:2000MSMemory Limit:65536KTotal Submissions:41944Accepted:18453DescriptionA numeric sequence ofaiis ordered ifa1#... 阅读全文
posted @ 2016-01-16 22:16 JoneZP 阅读(686) 评论(0) 推荐(0)
HDU1394 Minimum Inversion Number（线段树OR归并排序）
摘要：Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15113Accepted Submission(s... 阅读全文
posted @ 2015-10-05 15:13 JoneZP 阅读(226) 评论(0) 推荐(0)
UVA10487(二分）
摘要：Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find a sum of two distinct numbers from the set, whic... 阅读全文
posted @ 2015-08-16 14:18 JoneZP 阅读(126) 评论(0) 推荐(0)
ZOJ3574(归并排序求逆数对）
摘要：Under Attack IITime Limit:5 Seconds Memory Limit:65536 KBBecause of the sucessfully calculation in Under Attack I, Doctor is awarded with Courage Cros... 阅读全文
posted @ 2015-07-30 22:52 JoneZP 阅读(404) 评论(0) 推荐(0)
Can you find it? 分类： 二分查找 2015-06-10 19:55 5人阅读 评论(0) 收藏
摘要：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 find the three numb... 阅读全文
posted @ 2015-06-10 19:55 JoneZP 阅读(151) 评论(0) 推荐(0)
PIE(二分） 分类： 二分查找 2015-06-07 15:46 9人阅读 评论(0) 收藏
摘要：PieTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 109 Accepted Submission(s): 52Problem Descript... 阅读全文
posted @ 2015-06-07 15:46 JoneZP 阅读(121) 评论(0) 推荐(0)
Monthly Expense（二分） 分类： 二分查找 2015-06-06 00:31 10人阅读 评论(0) 收藏
摘要：DescriptionFarmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculate... 阅读全文
posted @ 2015-06-06 00:31 JoneZP 阅读(166) 评论(0) 推荐(0)