Others

Question: for every bracket string S (((()()()))). P-sequence: 4 5 6666 indicates the number of left parentheses before the k-th right parenthesis. W-sequence: 1 1 1456 represents the number of left brackets between each right brace and the matching

When you enter the password, a window will pop up. 789 456 123 Then, use the mouse to point one by one. Now there are coordinates of N points, and the distance between N points is fixed, but the position of the window will change, therefore,

Question: If you have n values, divide them into M parts (the order cannot be disrupted). How can we minimize the value of the largest part. Question: two points. Each median value is detected once. # Include int n, m; int spend [200000]; bool

question: a rectangle, divided into a * B squares of the same size, set n A robot is placed in some small squares, giving them some instructions. They will step by step follow the instructions, and each time there is only one robot. If two

A matrix contains four types of letters, N, S, W, and E, which indicate four operations: going up, going down, going left, and going right, A starting point is given. If the matrix can be displayed, the number of moves is output. If the final loop

There are M and N cities on the east and west coast of Japan, numbered from the North to the South. Now, some cities on the east and west coast are built between roads and the number of all intersections.Question: If there is an intersection between

Meaning: shuffling. Obtain the number of steps required for the given sequence. If the sequence is not obtained,-1 is output.Problem: When the sequence obtained by a step is the same as the initial sequence, it is possible to determine that the

Meaning: There are n pies, which should be allocated to F + 1 person. 1. You can divide a pie into several portions, but each person can only take one pie at most. 2. All people must have the same pie area. Find the pie area that everyone can get at

Question: int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,}; It represents a maze, where 1 represents a wall, 0 represents a path that can be taken, and can only walk horizontally or vertically, not

C group (C = s ). To assign the s value to the C group, each group can be allocated with a maximum of two values. Find the Optimal Allocation Method to minimize the value of imbalance. Where am = the sum of all values/C; CMI = the sum of the values

A queue is provided to find the maximum and minimum values of a specified interval.Question: rmq. Note that the boundary must be clear. Reference http://www.cnblogs.com/cnjy/archive/2009/08/30/1556566.html Rmq (range minimum/maximum query)

Given an ascending sequence (1-100000), for example, array [10] =-1-1 1 1 1 3 10 10 10, the maximum number of the same numbers in a certain range can be found. [2, 3] = 1, [1, 10] = 4, [5, 10] = 3. (Subscript starts from 1 ). Question: first,

Each star has a certain brightness value. Now there are many stars in the coordinate system. The coordinates and brightness values of each star have been given, and the maximum value that can be framed by a rectangle is obtained. Lazy flag. Question:

Question:There are multiple test data in this question. The first digit is m, indicating that there are m consecutive operations. When m = 0, the processing is aborted. Next is a operator C. When the operator is 'I', it indicates that there is a mm

N cities are connected by M roads. There may be multiple roads between the two cities. These roads are billed and there are two payment options. For example, from A to B: Method 1: pay r at B; Method 2: pay P before a (may include a), but Method 2:

Ask the area of the rectangle and.Question: Calculate the sum of the rectangle, because the location of the rectangle can change, so the area of the rectangle is not easy to find. At this time, we can use the idea of "segmentation", that is, to

Each snowflake has six horns, each of which is represented by a number. Enter n snowflakes. If two snowflakes are equal, twin snowflakes found is output. Otherwise, no two snowflakes are alike.Question: Hash # Include # include using namespace STD;

A: There is a 1-N camp on the ground of the enemy army. The number of people in each camp increases or decreases. There are four operations.(1) Add I j, I and j are positive integers, indicating that J individuals are added to camp I (J cannot

Question: a series of operations. Q (x, y) indicates the sum of the x-y elements in the output sequence. C (x, y, z) indicates adding Z to all elements of x-y.Question: Line Segment tree is easy. However, I heard that this question can be solved

A long chain has many hooks, numbered 1-N at a time. Each Hook has three kinds of gold, silver, and copper (, 1). Suppose it is copper at the beginning, each operation can change the hook in the range of x-y to the Z material. evaluate the value of