二分搜索
纯真zwj
这个作者很懒,什么都没留下…
展开
-
HDOJ 2178 猜数字
猜数字Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3813 Accepted Submission(s): 2721Problem DescriptionA有1数m,B来猜.B每猜一次,A就说"太大原创 2015-03-28 18:20:14 · 566 阅读 · 0 评论 -
POJ 2976 Dropping tests(二分搜索,最大化平均值)
Dropping testsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8233Accepted: 2883DescriptionIn a certain course, you take原创 2015-12-04 19:00:06 · 645 阅读 · 0 评论 -
POJ 3111 K Best(二分搜索,最大化平均值)
K BestTime Limit: 8000MSMemory Limit: 65536KTotal Submissions: 7491Accepted: 1936Case Time Limit: 2000MSSpecial Judge原创 2015-12-04 21:45:49 · 1063 阅读 · 4 评论 -
POJ 2456 Aggressive cows(二分搜索,最大化最小值)
Aggressive cowsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9062Accepted: 4504DescriptionFarmer John has built a new long ba原创 2015-12-04 17:55:48 · 465 阅读 · 0 评论 -
POJ 3258 River Hopscotch(二分搜索,最大化最小值)
River HopscotchTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 9791Accepted: 4172DescriptionEvery year the cows hold an event原创 2015-12-05 00:08:25 · 450 阅读 · 0 评论 -
POJ 3273 Monthly Expense(二分搜索,最大化最小值)
Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19454 Accepted: 7709DescriptionFarmer John is an astounding accounting wizard and has r原创 2015-12-08 21:36:51 · 452 阅读 · 0 评论 -
POJ 2010 Moo University - Financial Aid(优先队列or二分搜索—最大化K大值)
Moo University - Financial AidTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6572 Accepted: 1923DescriptionBessie noted that although humans have many un原创 2016-01-07 00:03:21 · 891 阅读 · 0 评论 -
POJ 3061 Subsequence(二分查找 or 尺取法)
SubsequenceTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10484Accepted: 4335DescriptionA sequence of N positive integers (10原创 2016-01-12 16:14:19 · 677 阅读 · 0 评论 -
51nod 1010 只包含因子2 3 5的数(打表+二分)
1010 只包含因子2 3 5的数基准时间限制:1 秒 空间限制:131072 KB 分值: 10 难度:2级算法题 收藏 关注K的因子中只包含2 3 5。满足条件的前10个数是:2,3,4,5,6,8,9,10,12,15。所有这样的K组成了一个序列S,现在给出一个数n,求S中 >= 给定数的最小的数。例如:n = 13,S原创 2016-10-05 20:53:26 · 519 阅读 · 0 评论 -
Codeforces 734C Anton and Making Potions(二分)
C. Anton and Making Potionstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton is playing a very interes原创 2016-11-16 07:30:35 · 1141 阅读 · 0 评论 -
POJ 1064 Cable master(二分查找)
Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31900 Accepted: 6827DescriptionInhabitants of the Wonderland have decided to hold a regional p原创 2015-12-03 22:40:45 · 3841 阅读 · 1 评论 -
Codeforces 600B Queries about less or equal elements(二分查找)
B. Queries about less or equal elementstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two arrays原创 2015-11-28 01:27:46 · 1525 阅读 · 0 评论 -
HDOJ 1007 Quoit Design(最近点对)
Quoit DesignTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37002 Accepted Submission(s): 9610Problem DescriptionHave you转载 2015-05-17 17:50:02 · 623 阅读 · 0 评论 -
HDOJ 2199 Can you solve this equation?(二分查找)
Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12794 Accepted Submission(s): 5715Problem Description原创 2015-07-30 11:33:02 · 1879 阅读 · 0 评论 -
STL之二分查找(binary_search(),lower_bound(),upper_bound() )
二分查找(二分检索):二分法检索又称折半检索,二分法检索的基本思想是设字典中的元素从小到大有序地存放在数组(array)中,首先将给定值key与字典中间位置上元素的关键码(key)比较,如果相等,则检索成功;否则,若key小,则在字典前半部分中继续进行二分法检索;若key大,则在字典后半部分中继续进行二分法检索。这样,经过一次比较就缩小一半的检索区间,如此进行下去,直到检索成功或检索失...原创 2015-07-30 16:44:38 · 6099 阅读 · 3 评论 -
HDOJ 2141 Can you find it?(二分查找,binary_search())
Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 17015 Accepted Submission(s): 4331Problem DescriptionGive you原创 2015-07-30 17:07:48 · 929 阅读 · 0 评论 -
HDOJ 1551 Cable master(二分查找)
Cable masterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2513 Accepted Submission(s): 940Problem DescriptionInhabitants of t原创 2015-07-30 21:24:03 · 749 阅读 · 3 评论 -
HDOJ 1969 Pie(二分查找)
PieTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6553 Accepted Submission(s): 2473Problem DescriptionMy birthday is coming up原创 2015-08-03 16:22:07 · 806 阅读 · 0 评论 -
HDOJ 2899 Strange fuction(二分,求导。。)
Strange fuctionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4287 Accepted Submission(s): 3092Problem DescriptionNow, here is原创 2015-06-23 22:32:27 · 519 阅读 · 0 评论 -
LightOJ 1297 - Largest Box (二分查找)
1297 - Largest Box PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MB In the following figure you can原创 2015-11-08 17:10:26 · 538 阅读 · 0 评论 -
POJ 3104 Drying(二分搜索,最大化最小值)
DryingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11464 Accepted: 2967DescriptionIt is very hard to wash and especially to dry clothes in winter.原创 2015-12-10 13:31:53 · 2550 阅读 · 3 评论 -
Codeforces 729C Road to Cinema(二分在t时间内到达终点最少需要的油量)
C. Road to Cinematime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya is currently at a car rental service原创 2016-11-21 02:59:54 · 1008 阅读 · 0 评论