二分答案
追风者_
要我自我介绍,挺秃然的
展开
-
Gym 101466 E - Text Editor KMP + 二分答案
题意:给你一个主串和模式串,找出模式串最大的前缀,使得其在主串中的出现次数大于等于n。思路:首先会想到KMP。但是如果直接拿模式串一位一位匹配是O(n2)的时间复杂度,肯定过不了。我们发现模式串长度越长,越不容易满足要求。所以这里有个单调性,可以来二分。我们二分答案可能的长度,然后用这么长的前缀丢进KMP里面,看看能否满足,如果发现可以,就把长度调大一点,反之调小一点。时间复杂度O(nlogn)。最后注意KMP用来计数时,每次匹配完不能直接j=0, i -= p.size(),因为这样会使得指针回溯原创 2020-10-13 13:34:55 · 256 阅读 · 0 评论 -
【CodeForces 1156C】 Match Points 二分答案
You are given a set of points x1, x2, …, xn on the number line.Two points i and j can be matched with each other if the following conditions hold:neither i nor j is matched with any other point;|xi−xj|≥z.What is the maximum number of pairs of points yo原创 2020-07-31 12:44:46 · 333 阅读 · 0 评论 -
【BAPC 2016 J】 Programming Tutors 二分图 二分答案
You are the founder of the Bruce Arden ProgrammingCollective, which is a tutoring programme that matchesexperienced programmers with newbies to teach them.You have N students and N tutors, but now you haveto match them up. Since the students will have原创 2020-07-23 17:02:30 · 260 阅读 · 0 评论 -
【Maratona de Programa¸c˜ao da SBC 2019 M】 Maratona Brasileira de Popcorn 二分答案
The “Maratona Brasileira de Popcorn” is a competition that takes place annually to find out whichteam is the most organized, prepared and well-trained in the art of eating popcorn. It is organized byBrazilian Society of Popcorn Eaters (SBCp, its acronym原创 2020-07-22 16:36:12 · 384 阅读 · 0 评论 -
【暑训组队 #1】 Bonuses on a Line 二分
There are n bonuses on a line: the i-th bonus is located at the point xi. All coordinates of all bonuses are distinct. You are located at the point with the coordinate 0. How many bonuses can you collect in t seconds, if you can pass the distance 1 in one原创 2020-07-15 17:19:14 · 546 阅读 · 0 评论 -
【Codeforces Round #651 (Div. 2)】 D. Odd-Even Subsequence 二分答案
Ashish has an array a of size n.A subsequence of a is defined as a sequence that can be obtained from a by deleting some elements (possibly none), without changing the order of the remaining elements.Consider a subsequence s of a. He defines the cost of原创 2020-07-10 22:58:31 · 267 阅读 · 1 评论 -
【校队暑训个人赛 #1 H】 二分答案
A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequenc原创 2020-06-25 18:49:09 · 245 阅读 · 0 评论 -
【CodeForces 676C 】 Vasya and String 二分法
High school student Vasya got a string of length n as a birthday present. This string consists of letters ‘a’ and ‘b’ only. Vasya denotes beauty of the string as the maximum length of a substring (consecutive subsequence) consisting of equal letters.Vasya原创 2020-06-20 14:21:25 · 196 阅读 · 0 评论 -
【POJ 3579】 Median 二分答案 + lowerbound
Given N numbers, X1, X2, … , XN, let us calculate the difference of every pair of numbers: ∣Xi - Xj∣ (1 ≤ i < j ≤ N). We can get C(N,2) differences through this work, and now your task is to find the ...原创 2020-05-01 11:23:15 · 324 阅读 · 0 评论 -
【POJ 3258】 River Hopscotch 二分答案
DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight riv...原创 2020-04-30 18:54:17 · 195 阅读 · 0 评论