Others

Source: Click to open the link DFS, pay attention to pruning. For example, if the remaining 4 is equal to 0, many questions on the Internet are detailed. # Include # include # include using namespace STD; bool visited [25]; int stick [25];

250,500 is relatively simple, and 1000 is started after completion It is found that 1000pt is a counting question similar to the tree-like DP. Ask you to select the total number of several vertices from the tree with 50 nodes. These vertices must

record the continuous segments of 0 and 1 respectively. It is not difficult to change the 01 value or think clearly. # Include # include # include using namespace STD; # define lson L, M, RT B? A: B;} int min (int A, int B) {return a 1) LPA

Many people have read stacks and queues, right? Isn't that what I didn't mean? Well, I will make this record. When I get old, I can give my grandson a stack and a queue. The stack and the queue are both advanced and backward, and the stack is a dog

The fragments encountered during mntfs tracing Code do not understand From kernel design and implementation The kernel thread can only be created by other kernel threads. The kernel automatically handles this by generating all new kernel threads

The competition was still smooth. The only pity was that 1000pt was not made out. I did not think clearly before writing it. I wrote anything when I thought of it, which led to the loss of AK opportunities .... 250pt: Question, not

Link: http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemcode = 3408. So domineering question Gao !!! Q: enter an integer U for each query to obtain the number of shortest paths passing through U. Similar to this question, I suddenly found

Question: Give a length of N 1 ~ N. You must query the maximum value of the maximum common approx. of any two numbers in a range. Solution: if the number X is the maximum common number, it is necessary that the two numbers are multiples of X, so we

The AC is very strange, indicating that they do not understand it. Is this the Fleury algorithm? Are there any great gods who pass by to help explain. # Include # include #include using namespace STD; # define for (I, a, B) for (INT I = (a); I

Interval division. This course has learned many new things & new ideas on this topic. The following describes the process of thinking in detail. Question: Give a graph, each vertex has (1 ~ N), there are NQ queries, and the question range is L ~ R

Today, I made a game question in poj. I learned about the tiered game... I will explain my understanding of the tiered game below ..   The first is to describe the tiered game... the game is played on a column of tiers... there are several natural

-- Okay, my first multi-school session is over. For the first time, I officially participated in the competition (and other schools). This time, I bought another place from instructor ye and paid 300 yuan (I'm sorry for the money .. Orz). Well, in

Dalian Network Competition (HDU 4003 find metal mineral) I think this question can be done, but I didn't do it because I didn't see it at the time. Now, if you have time and your status is very good, maybe it can be done,   The following code is

Hdu_2473 junk-Mail Filter and query set This question is a good query set, which also makes me know and query the set. It is not only the checking function, but also the Deletion Point !! Original question connection:

Question connection The DP status of this question is DP [I] [J], which indicates that the first apron of the previous I time has the maximum value when J planes fly out. Because there are only two la s, the first one is only OK, and the second one

Given N points to form a ring, a point in the middle is 0, and each point is 0 connected to an edge. The question starts from 0, the number of paths passing through m edges enables the return to 0. Each edge of each vertex can go through multiple

After all the hardships, I finally figured out the complete backpack. From this, I am not very familiar with the dynamic planning sub-structure. Come on !!! Believe in yourself! I can... Question: Select a coin to fill the bottle (w) with the

The topic is very long. After reading it, the naked Huffman tree is a basic thing in the data structure. I used to write a program for coding Huffman, however, I felt that it was not necessary to put all the Huffman balls out. I checked it online

Calculation of HDU 2179 pi First, a large number of versions of the Program (Java water, do not want to write high precision ..) import java.math.BigDecimal;import java.math.BigInteger;import java.util.Scanner;public class Main {public static void

    Today, I learned about the tree array. Its main function is to query continuous interval values. Although the complexity of the modification is logn, I want to evaluate a [1] ~ The time complexity of the sum of a [n] is also logn. compared with