Others

Hdus 2522 a simple problem The essence of division: simulate the process of division; An array is used in the middle to save the remainder. If the remainder appears twice, a circular section appears; Negative values may occur; # Include #

1058 question: The overall idea is to use the elements in the known sequence to generate new elements according to rules.,For exampleX * 2, x * 3, x * 5, x * 7. Assuming the array is used A [Max] All elements that store this sequence , First

Question: The question will be provided with known conditions or questions in this form, Analysis: first of all, you can use and query the set. The question is X1 ^ X2 ^ X3 ^ ...... Sub-value, First, we need to consider two issues: 1):

HDU 1556 color the ball The question is left blank. I used a line segment tree, but there is no line segment tree method, but I cannot explain it. PostCodeRight # Include # define maxn 100010 using namespace STD; int P [maxn 1; if (L mid)

Initialization. All lights are on, Then there are only four operations in total 1) All lights are reversed. 2) invert of the lamp numbered with an odd number 3) invert the number of lights with an even number 4) invert the light numbered 3

Prime return First generate the number of replies in all ranges, and then find all prime numbers in the range; Hey, the method for determining prime numbers is so awesome that it is hard to understand. /* ID: nanke691lang: C ++ task: pprime */#

I am depressed and want the longest reply string; It reads a text string containing punctuation marks, and then ignores the punctuation marks when retrieving the string. The output also outputs the punctuation marks ............ It hurts for a

John, a farmer, is proud of having the healthiest cows in the world. He knows the minimum amount of vitamins required for each type of feed. Please help the farmer to feed his ox to keep them healthy, so that the number of feeds fed to the ox is

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3810 Objective: magina gets m units money in the shortest time. It is known that there are n monsters distributed in N locations, playing each monster can get Gi money, but it also

Given n intervals, calculate the length of the longest continuous interval in the last interval and the length of the longest non-covered interval. Analysis: it could have been a direct brute force attack, but I wanted to know how the line segment

Hey, I typed every fib into the table first, and then it was very violent to find it within the range. # Include # include # include # include # define maxn 600 using namespace STD; int sum [maxn + 1] [50], len1 [maxn + 1]; int A [50], B [50],

Given an array with a length of N, it is composed of {1, 2, 3} And is arranged as the minimum number of moves without downgrading the sequence. Analysis: Obtain the numbers of 1, 2, and 3 respectively. Count [1], Count [2], Count [3]; then, you

Ha, I handed in Java and C ++ each time. C ++ # Include # include using namespace STD; int sum [201] [50], len1 [201]; void Init () {sum [0] [0] = 0; len1 [0] = 0; sum [1] [0] = 1; len1 [1] = 0; sum [2] [0] = 2; len1 [2] = 0; For (INT I = 3; I

Select some vertices in a tree. Each vertex has a weight value to maximize the sum, provided that only one parent node and one child node can be selected. Analysis: entireCodeBasically the same as 1054, the state transition equation has changed

Ah, it's so careless to have such a question. How many bright areas are there on the X axis when a point light source and N line segments are known? Analysis: first obtain the N intervals projected on the X axis, and then the simple range

Http://search.csdn.net/In csdn search, csdn still has a lot of programming resources, and many things can be found through its search.CodeCategories are also comprehensive. Http://snippets.org/Simple and practical code collection websites,

There are N power stations, each of which has a certain amount of power, and there is a certain distance between the power stations. We need to take some power stations out of 0, make the total power of the occupied power station more than half of

 Precise coverage: First, select the column to be overwritten (including the least one column), remove the column and all the rows that can be overwritten by the column, and then enumerate the method to add. Enumerate a row of R. If it is a

Similar to hdu1520, if a tree is specified, several points must be selected. However, if a parent node and a son node are selected, they cannot be selected at the same time .. Calculate the maximum number of nodes that can be selected, and determine

After a long tangle of questions, I finally got through the idea of converting LCA to rmq. First, obtain the Euler's sequence f [] and depth sequence B []. At the same time, use POS [] to record the first appearance position of each node (position