Programming VIP

Our journey is the sea of stars: topic The latest Mars exploration robot curiosity is trapped in a two-dimensional maze composed of squares. There are four kinds of squares: 　　‘.’ Represents the open space, and curiosity can pass through it '#' stands for obstacles, which cannot be crossed or stayed 'S' represents the starting ...

Examples AcWing 1210. Consecutive interval number Xiao Ming has been thinking about such a strange and interesting question these days: How many consecutive intervals are there in an arrangement of 1 ∼ N? The definition of the serial interval here is: If all the elements in the interval [L,R] (i.e. the L-th to r-th elements of this ar ...

catalogue divide and rule Merge sort python code implementation Time complexity Quick sort python code implementation Time complexity   divide and rule divide and conquer (D & C) -- a famous recursive problem solving method. The so-called "divide and conquer" is to divide a complex algorithm problem into equivalent sma ...

Catalogue of series articles I Array type problem solving method 1: dichotomy II Array type problem solving method 2: Double finger needle method III Array type problem solving method 3: sliding window IV Array type problem solving method 4: simulation V The basic operation and classic topics of the linked list Vi Classic title of hash tab ...

Sorting: assume that the sequence containing n records is{}, the corresponding keywords are{}, need to determine 1, 2, An arrangement of n, so that the corresponding keywords meet(non decreasing or non increasing) relationship, even if the sequence becomes a sequence ordered by keywords{}, such an operation is called sorting. Internal sorting: ...

Top ten sorting algorithms Properties of sorting algorithm OI Wiki: introduction to sorting Stability: whether the relative order * * of equal elements has changed after sorting.Time complexity: time complexity is divided into optimal time complexity, average time complexity and worst time complexity. Select sort OI Wiki: select sort Al ...

Bubble sort Outer cycle: i (0~length-1) The outer layer loops as many times as the length of the array is Inner cycle: j(0~j-i-1) scope of execution Current element: 0~Array length -i-1 (minus I because the last element is not considered for every execution of the outer layer; minus 1 to avoid j+1 causing the array subscript to cro ...

An ordinary queue is a first in first out data structure. Elements are added at the end of the queue and deleted from the queue head. In some cases, we may need to find the maximum or minimum value in the queue. For example, a queue is used to save computer tasks. Generally, computer tasks have priority. We need to find the task with the hig ...

Title details: Common scoring method for 1073 multiple choice questions (20 points) Correcting multiple-choice questions is a troublesome thing. There are many different scoring methods. One of the most common scoring methods is: if the examinee selects some correct options and does not select any wrong options, he will get a 50% score; If a c ...

Title Description Arrange 1 ∼ n in order to form a sequence. The number I is just in position i. Then give a position sequence p1,p2,..., pn with length N, which is an arrangement of 1 ∼ n. Next, we will repeatedly perform the following operations on the sequence: Rearrange the position of each number in the sequence and move the nu ...