二分查找
二分查找
Guuuuuu老师儿
当初的算法竞赛题目博客的留言评论就不回复了,时间太久已经忘干净了,抱歉~
展开
-
Distances to Zero(lower_bound和upper_bound应用)
B. Distances to Zerotime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given the array of integer numbers a0,原创 2017-10-29 15:53:15 · 462 阅读 · 0 评论 -
Three-level Laser (贪心+二分)
Three-level Laser An atom of element X can exist in n distinct states with energies E1 < E2 < ... < En. Arkady wants to build a laser on this element, using a three-level s...原创 2018-05-22 16:47:48 · 492 阅读 · 0 评论 -
Prefix Sums CodeForces - 837F(思维+二分+组合数)
Prefix Sums CodeForces - 837FConsider the function p(x), where x is an array of m integers, w...原创 2018-04-05 14:45:11 · 244 阅读 · 0 评论 -
The Longest Straight FZU - 2216 (枚举左端点+二分右端点)
The Longest Straight FZU - 2216 ZB is playing a card game where the goal is to make straights. Each card in the deck has a number betwee...原创 2018-04-15 15:48:38 · 282 阅读 · 0 评论 -
4个数和为0 51Nod - 1267
4个数和为051Nod - 1267给出N个整数,你来判断一下是否能够选出4个数,他们的和为0,可以则输出"Yes",否则输出"No"。Input 第1行,1个数N,N为数组的长度(4 <= N <= 1000)第2 - N + 1行:Ai(-10^9 <= Ai<= 10^9) Output 如果可以选出4个数,使得他们的和为0,则输出"Yes",否则输出"No"。 Sa原创 2018-01-26 17:31:31 · 249 阅读 · 0 评论 -
Gadgets for dollars and pounds CodeForces - 609D (二分)
Gadgets for dollars and pounds CodeForces - 609D Nura wants to buy k gadgets. She has only s burles for that. She can buy each gadget fo...原创 2018-03-22 10:45:13 · 303 阅读 · 0 评论 -
Professor GukiZ and Two Arrays CodeForces - 620D (暴力枚举+二分搜索)
Professor GukiZ and Two Arrays CodeForces - 620D Professor GukiZ has two arrays of integers, a and b. Professor wants to make the sum of...原创 2018-03-14 09:42:03 · 331 阅读 · 0 评论 -
One-Dimensional Battle Ships CodeForces - 567D (二分做法+解释)
One-Dimensional Battle ShipsCodeForces - 567DAlice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting ofn square cells (that is,原创 2018-01-28 19:02:07 · 467 阅读 · 0 评论 -
Mike and Chocolate Thieves CodeForces - 689C (二分思想)
Mike and Chocolate ThievesCodeForces - 689CBad news came to Mike's village, some thieves stole a bunch of chocolates from the local factory! Horrible!Aside from loving sweet things,原创 2018-01-26 17:24:53 · 292 阅读 · 0 评论 -
Burning Midnight Oil CodeForces - 165B
Burning Midnight OilCodeForces - 165BOne day a highly important task was commissioned to Vasya — writing a program in a night. The program consists ofn lines of code. Vasya is already ex原创 2018-01-23 09:38:27 · 675 阅读 · 0 评论 -
Telephone Lines POJ - 3662(二分+最短路)
Telephone LinesPOJ - 3662Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables requir原创 2017-12-07 16:23:12 · 385 阅读 · 0 评论 -
Magic Powder - 2 CodeForces - 670D2 (二分)
Magic Powder - 2 CodeForces - 670D2 The term of this problem is the same as the previous one, the only exception — increased restrictions.InputThe first line contains two positive in原创 2017-11-15 21:29:36 · 285 阅读 · 0 评论 -
POJ 2456 Aggressive cows 二分
题目大意:给你n个牛舍,把c只牛放在牛舍里,要求最近的两头牛之间距离最大。思路:直接二分,从最大长度开始二分查找,选取一个长度,然后选择两个牛圈大于等于这个长度进行安置牛,最后判断能不能把所有的牛放进去,如果可以left=mid找更大的,如果不行,说明太大了,right=mid找小一点的 #include #include #include原创 2017-10-21 23:22:58 · 173 阅读 · 0 评论 -
二分查找
下面谈一谈我对二分查找的理解看上去二分查找主要会用到的是有两种,加上最简单的是三种,因为做过的题比较少,目前只先谈一谈对这三个的理解,以后做的题多了再修改1.最朴素的二分/** * 二分查找,找到该值在数组中的下标,否则为-1 */static int binarySerach(int[] array, int key) { int left = 0;原创 2017-10-21 22:31:37 · 216 阅读 · 0 评论 -
Cable master(二分查找)
Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31900 Accepted: 6827DescriptionInhabitants of the Wonderland have decided to hold a regional p原创 2017-10-18 20:33:25 · 309 阅读 · 0 评论 -
Monthly Expense(二分)
Monthly ExpenseFarmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi ...原创 2018-10-15 11:23:15 · 434 阅读 · 0 评论