Others

At the beginning, I tried to use the State compression DP to solve this problem. Later I found that the State could not be opened... I still did not understand it very well. Here we can regard the chessboard as two squares. Because they can only

CodeAs follows: # Include # Include # Include # Include Using Namespace STD; Int P [ 40010 ], [ 10000 ], B [ 10000 ]; Void Pre (){ For ( Int I = 4 ; I 40010 ; I + = 2 ) {P [I] = 1 ;} For ( Int I = 3 ; I 200 ; I + = 2 ){ If (! P [I])

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1421 Given n items, select K pairs. The cost of each pair is the square of the weight difference between the two items. Determine the policy to minimize the total cost. The restriction of this problem

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1789 The question is how to assign a sequence of jobs to obtain the most scores. Set DP [I] [J] to indicate the maximum score that can be completed on the J day as of the end of the I job. The DP

This topic defines the coordinates of vertices in a given grid. Now we want to destroy these vertices. There is a weapon that can destroy one row or all targets in one column at a time, ask the minimum number of times that the weapon can be used to

#, # @ And \ symbols in the macro definition of C LanguageSource: Liu shihui Rubby logs 1. # (stringizing) string Operators   Purpose: Convert the input parameter name in the macro definition to a parameter name string enclosed by a pair of double

Direct violence. The Code is as follows: #include #include #include #include #include using namespace std;char word[10005][55], c[55];mapmp;bool Del(int x){ int length = strlen(c), sum = 0; if (length != strlen(word[x])+1) { return

This is a simple question of interval summation, which is just as imagined by the enemy army of Hangzhou power. It is written using splay. Splay means stretching, because the tree will execute the rotate function in large quantities during use. This

This question is not exactly the same as that of other binary graphs. As long as it allows overlapping points to be used, the method of finding an augmented path cannot be reused. Therefore, this question needs to be converted to an indirect method.

This question is very interesting. Ask if the question can be made between time and space. This is very similar to the previous poj1860, but it only describes two points: 1. the routing is bidirectional, and the holes are unidirectional. 2. In the

If the data Scope of this question is small, it will be violent and there is nothing to discuss. The Code is as follows: # Include # include # include # include using namespace STD; int n, m, seq [150]; int main () {int ret; while (scanf ("% d"

I have heard that if you have been walking along a wall in a maze, you will surely be able to walk out of this maze. This is a strange question. I want to ask you the time and minimum time it takes to walk along the wall on the left and the wall on

This question has a certain skill, need to calculate the meaning of a point in the time complexity of nlog (N), N-1 points to the distance between the sum, here need to use such a technique, calculate the distance from X and Y separately. First,

It is easy to use greed to solve this problem. It directly kills the object with a high output per unit time of the other party. The Dynamic Programming solution for this question is to compress n enemies into an int number, DP [J] indicates the

The question is how to minimize the cost of opening a tree without any other similar nodes. We sort the edge in order from large to small, and then check whether this edge can connect two similar nodes. If yes, this edge is the edge to be selected.

This question is to find the maximum number of power to which a number can be opened. This includes a negative number and must be read in long data. First, we break down the prime factor of this number and calculate their respective numbers. Then,

Description The final assessment of the Data Structure Course Design of a school is coming soon. In order to examine students' understanding of the tree structure and test their programming ability, the school sets one item of the examination: write

This is the sum of non-repeated numbers in a range. We sort the right endpoint of the query interval, and record the last occurrence position of each number. Because the query is not backtracking, we can update it linearly. The Code is as

Find out all the numbers that do not intersect with N, and then apply the content rejection theorem to obtain the final result. This question is equivalent to a * B ^ C (-2) mod C. use x/lnx to estimate the approximate number of prime numbers. The

Given n trees, M mushrooms, and a burst of wind, the right of the expected surviving mushrooms is obtained. We can convert it to the expected weight value after the storm of mushrooms, and then add the weight of all mushrooms. Therefore, we update