Others

Hdu_1075 This topic is used to practice the dictionary tree. Because there is a lot of data on the subject, the array will be wa when it is opened up. # Include # Include String . H># Include # Define Maxd 500010 Char STR [ 30 ], B [ 30 ], TXT [

Poj_3630 In order to practice the dictionary tree, I did this question. Although there were only 10000 numbers when I opened the array, there may be 100000 number elements in the dictionary tree. # Include # Include String . H># Include #

Poj_1269 You can use the cross product to determine whether two straight lines are in the same or parallel line. If there are intersection points, you can use the resolution ry method. # Include # Include String . H> # Define Zero 1e-8 Double X1,

Poj_3525 This topic limits a convex polygon. Therefore, the range of a polygon is equivalent to the intersection of a half plane in a straight line where each side is located. It is obviously not equivalent if it is a concave polygon. First, we

Poj_1696 A more intuitive idea is that if I am at a certain point now, I will see it in the direction I just walked through, and then turn left gradually until the first point is reached, then you can go over to that point. It is not difficult to

Poj_1389 This topic is basically the same as poj_1151. For some specific ideas, refer to my question: http://www.cnblogs.com/staginner/archive/2012/02/20/2359396.html. # Include # Include String . H># Include # Define Maxd 2010 # Define Zero 1e-

Poj_2653 There is a key condition for this question: "You may assume that there are no more than1000top sticks. in this way, if we read the line segment while reading it, we can determine which of the above are overwritten, which will bring about 1

Poj_3304 At the beginning, I didn't know what the project meant. I understood it as determining whether a straight line exists and can interwork with all line segments, after the meaning of Baidu project, it was found that there was a straight

UVA_839 Although this question is about the tree structure, we do not need to establish the tree structure, because we do not have to traverse the tree later. The process of reading data is a process of traversing the tree, in this process, the

Uva_000070 At first, I didn't know that rounding down meant rounding up. I thought it was a round-down, so I was confused when I was decisive ...... The greedy idea is hard to think of, if halved does not make the file less than M and is more

UVA_10125 The core idea is to first create a hash table for the value of a + B and then enumerate the value of d-c, if a + B is found to be the same as d-c and the four elements are different, update the final result. Of course, the design of the

POJ_3332 I used to ask what gestapour Finite Automation is. I only remember that he told me that it will convert itself between finite states, so I wrote this question according to this understanding, I didn't expect that the program I wrote was

UVA_10570 At first, I didn't understand the exchange positions mentioned in the question. I thought that only adjacent ones could be changed. Later I found that non-adjacent ones could also be changed. The first time the AC was a bit YY, but I

POJ_3261 This question is similar to POJ_1743, but it must be required to repeat at least K substrings. We can use the length k of the binary string to convert the question into a string with a minimum length of K if there are at least k repetitions.

URAL_1297 One of the most intuitive algorithms for retrieving text strings is to enumerate the vertices in the middle and search for them on both sides to see how far they can be extended. But this is an algorithm of n ^ 2, the suffix array can be

POJ_1204 In fact, this topic of POJ is not strictly described, So I first went to SPOJ and handed it back. This question can be done using an AC automatic machine. In order to successfully locate the first position of a word after matching the word,

POJ_2774 In fact, this question is to find the longest common substring. If gets is used to read the string, it will WA, so scanf must be used. First, we can merge the two strings and add a '$' in the middle to avoid a public prefix in both strings.

POJ_1059 As the question says that the number of times the dice Finally rolled will not exceed 1000, you can directly simulate the process of the dice. #include#include#define MAXN 1010#define MAXD 110#define MAXP 10int P, die[MAXN], g[MAXD],

SPOJ_220 This question is very similar to POJ_1743. The question of POJ is to find the longest repeated string that does not overlap, and this question is to find a string, this makes it the longest repeated string of each string that does not

UVA_757 Obviously, phishing will not go back because it will not be optimal if it goes back. So we can enumerate the locations where we are going. The remaining problem is how to fish in these accessible rivers is better, because the rivers are