Programming VIP

1, What is dichotomy? Dichotomy, also known as binary search, is generally used to find the position of a value in an ordered array or the insertion position of a given specific value; Compared with the O (n) complexity of traversing the entire array once, binary search can reduce the complexity to o (logn); The basic concept of bisectio ...

transport plan Title Link: ybt high efficiency advanced 4-5-5 / luogu P2680 General idea of the topic There is a tree with weights on its edges. Then there are some paths, and then you can choose an edge and make its weight become 0. If you want to make the modified longest given path the shortest, output this value. thinking First, when y ...

Hello, friends (^ - ^) 🌹🌹🌹， I'm Yang Zhi, a dull blogger who is taking steps in the field of algorithms~ At present, it is still a pure vegetable Wang 🐶. The typical kind of food is noisy 👀， I can't do a lot of things well, I can't say a lot of things well, and I can't write questions 😅, Still working, still moving forward 👣. Becaus ...

[Algorithmic Basics Lesson] 1. Basic Algorithms (Top)] Quick Sort, Merge Sort, Binary 1. Basic Algorithms (Top) 1.1 Quick Sort step Determine the demarcation point: x = q[l] / x = q[(l + r) / 2] / x = q[r] / randomAdjust range: Recursive processing on left and right ends Template void quick_sort(int q[], int l, int r) { if ( ...

Euler loop / Bridge Title Link: YBT2022 winter vacation Day3 B / LOJ 2460 General idea of the topic Give you a picture, the side is two-way, and the cost of walking on both sides is different. You should choose some edges to walk, and then form an Euler loop, and the maximum cost of the selected edge is the least. To output this cost and the ...

First, see minimize y − x y-x y − x this thing, decisive two points y − x y-x y &m ...

course: https://github.com/youngyangyang04/leetcode-master 34. Find the first and last positions of elements in the sorted array (medium) Link: https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/ Title Description: give an integer array nums arranged in ascending order and a target value target. Find ...

Guide to series of articles Guide to series of articles Open source project All articles in this series will be included in GitHub for unified collection and management. Welcome ISSUE and Star. GitHub portal: Kiner algorithm 69. Square root of X Problem solving ideas We can use dichotomy to solve this problem. Because we know: parseInt ( ...

Question surface: Tangible, such as a x^3 + b x^2 + c x + d = 0. The coefficients of each item in the equation (a, B, C and D are real numbers) are given, and it is agreed that the equation has three different real roots (the range of roots is - 100 to 100), and the absolute value of the difference between roots is ≥ 1. It is required to ou ...

Multi school provincial selection simulation 7 Passing Zhongdan meaning of the title Give you a string \ (s \), each time you ask if \ (s[l:r] \) can be worthy of Dan, and a string can be worthy of Dan, if and only if you can traverse each position of this substring through several walks. A walk is to move from a point \ (i \) to a different po ...