Others

Question: Returns the number of n columns A [] and Q, and queries the sum of the values between [L, R]. calculates the maximum value of the sum in the full arrangement of. Ideas: Record all inquiries, and mark the number of times that item I is

Original question link: http://acm.nyist.net/JudgeOnline/problem.php? PID = 1, 613 ACCode: # Include # include #include #include # include using namespace STD; const int max = 100000 + 10; int DP [Max] [12]; int max (int A, int B, int c)

Original question link:Click Open Link Question :...... Idea: Create a bipartite graph based on the numbers of people who like and dislike cats and dogs. If two people like it and do not like conflict, create an edge and convert the problem to

Find the number of visible points in the N * n range. Only the lower half triangle area can be considered. The following rule can be found from the process of generating visible points: If both X and Y coordinates C and R start from 0 (C, R)

Original question connection: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4185 Question: The description of the question is very junk .. Simply look at the figure in the question and find the number of pairs at most # (the adjacent two are a

Generate a farey sequence with the denominator not greater than N. This is a recursive method. We can use the Extended Euclidean theorem to find the next item next to the nearest vertex, Formula K1 * L2-K2 * L1 = 1 But I haven't learned it yet... #

Most of the explanations are as follows: Http://hi.baidu.com/timer/item/ebc8c7ef908085215b2d6476 Question: (1 ^ B + 2 ^ B +... + A ^ B) % 1 ≤ A ≤ 1000000000, 1 ≤ B ≤ 1000000000 Ideas: A and B have a large range. It is certainly not possible to

Poj1833 Question connection: http://poj.org/problem? Id = 1833 Question: The meaning of the Chinese question is not much to be said, but the next_permutation () function in STL is used. /* The arrangement function in next_permutation (OP1, OP2) STL.

Question: The H * w area is paved with 1*2 bricks. There are several paving methods. Ideas: (Routine source: Http://gisyhy.blog.163.com/blog/static/129390343200992441558735/ Http://blog.sina.com.cn/s/blog_62ebd4410100h081.html Partial

Question: Returns a number N, and calculates the number of numbers from 1 to n containing 49. Ideas: By-bit DP. DP [I] [0] I bits num including 49DP [I] [1] I bits num excluding 49 but heading with 9DP [I] [2] I bits num excluding 49 Transfer

Original question connection: Click to open the link Question: to give a matrix, the point value of the matrix is 0 or 1. Each time you can change all rows or columns of the Matrix to 0, ask the minimum number of times required, all vertices in the

Review the above example: 1. We use the inherited method. As a result, the duck behavior changes constantly in the subclass. To adapt to this change, we have to overwrite the parent class method in the subclass over and over again, as a result, a

After reading the windows program design, I made a comparison of junk gadgets! Code: # Include # include # include # include # include using namespace STD; string str_exp = "assumer.exe"; string str_qq = "qq.exe"; bool terminateprocessfromid

Original question connection: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2458 Question :............ Train of Thought: Calculate the least point set by the anti-key edge to overwrite the key. Boys + girls-key is the answer. After Anti-edge

/*************************************** * *********** The subject is as follows: N points and N-1 edge, to ensure that the entire graph is connected (because of edge restrictions, so it is impossible to form a ring); each side length is 1, ask the

Question: N stones are given in a total of M colors. Ask at least a few stones to make the same color continuous. For more information, see annotations. # Include # include # include using namespace STD; const int Kmax = 105; // DP [x] [y] [Z],

Question connection: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3006 Train of Thought: binary, bitwise operation |, to mark the status. For example, if 2, 4, and 6 appear in a set, use the binary number 101010 = (decimal) 2 + 8 + 32 = 42 to

Original question connection: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3449 Question: see it for yourself ~~~ Thought 1: first carry out a 01 backpack on the items in the box, then add the price of the box, group the backpack, and then TLE !!

The question is to initialize the number of artillery people, then make a series of modifications to it, and finally query the number of people in the range and Timeout occurs when an array is used. Use a line segment tree instead. # Include #

Typical matrix operations (2) as long as the sum of the power of the matrix or the power of the first K These questions are generally given a matrix. This is a template question, which is relatively simple. There is a fast algorithm in number theory