Others

Spoj_2157 In fact, since there is only one group of solutions, we can regard the number of machula as an unknown rather than simply taking machula as an unknown number, this can be easily converted into a + B or A-B problem. # Include # Include

Hdu_4348 You can use a persistent line segment tree to implement O (1) back operations. If you want to improve efficiency, we recommend that you use the single-point modification + interval query mode to replace the interval modification +

Hdu_3452 If the root of the tree is T, F [I] indicates the minimum cost required to disconnect the leaf from T in the tree. To disconnect the leaf and T in the subtree of I, it is to disconnect the leaf and T in the subtree with all children of I

Poj_3621 First, the conforming ring must be a simple ring. Assume that the optimal route consists of two simple Rings X and Y. If the average value of X is the same as the average value of Y, selecting any simple ring of X or Y meets the

Ural_1471 This topic can be divided by tree links. We also recommend an easy-to-understand blog about tree links: http://blog.sina.com.cn/s/blog_6974c8b20100zc61.html. # Include # Include String . H> # Define Maxd 50010 # Define Maxm 100010 Int

Hdu_4441 1. Insert As for finding the smallest unexperienced positive integer, it is easy to maintain a line segment tree. There is no difference between the insert + I operation and the insert operation of the common splay, And the insert-I

Uvalive_4271 This topic described the necklace in detail and magic at first, but then I thought about it carefully. In fact, as long as there is a loop between S and T, that is, from S to T and then come back, without repeating the edge, this loop

Hdu_3311 I did not understand the question ...... Worship the great gods who understand the meaning of the question, and attach a question "stolen: [Topic] Give n temples and m other places. Then, assign the fixed point permission to

You can use F [I] [J] to represent the sum of J in the last segment when the first I bit is recursive, and then perform DP. # Include # Include String . H> # Define Maxd 30 # Define # Maxs 250 Int N, S, A [maxd], F [maxd] [Maxs]; Char B [maxd];

Uva_11255 The key to applying the Burnside theorem is to find the number of immobile solutions for each replacement. Import Java. Math. biginteger; Import Java. util. vendor; Public Class Main { Static Int Maxd = 50 ; Static Scanner

Uva_11994 This topic has fewer barriers to thinking, because it is actually the basic operation of link-cut-tree, and a more complex link-cut-tree question --Hdu_4010. When maintaining the number of colors above the path, because there are only 3

Hdu_3681 Since y and G are less than 15, the shortest circuit between F, y, and g can be processed in advance and then converted into the TSP problem. # Include # Include String . H> # Include # Include # Define Maxd 20 Int N, m, DIS [maxd] [

Uva_11987 In fact, operation 2 is equivalent to deleting X first and then merging Y. Therefore, compared with a common query set, operation 2 only deletes a certain vertex. For the delete operation, the point of P [] in the original tree cannot

Hdu_2234 This topic can start from the final state and pre-process all the States within five steps. In order to further reduce the state, the final state can be viewed as one of the following using the minimum representation: 1111 2222 3333

Sgu_185 This problem is caused by serious dizziness of the memory card ...... In fact, the train of thought is still intuitive. Because two roads do not overlap, you only need to use the network stream, and add the two shortest paths, the

Hdu_3278 Although there will be a lot of States if you consider three colors, if you decide which color we want to move to the middle, the remaining two colors can be regarded as one color, therefore, you can record the result from the BFS first,

POJ_3204 This is the same as ZOJ_2532. For details, refer to my ZOJ_2532 Issue Report: http://www.cnblogs.com/staginner/archive/2012/08/11/2633751.html. #include#include#include#define MAXD 510#define MAXM 10010#define INF 0x3f3f3f3fint N, M,

SPOJ_913 This topic can also be divided into tree links, but it is better to use link-cut-tree to write data in KTH. #include#include#define MAXD 10010#define MAXM 20010int N, q[MAXD], first[MAXD], e, next[MAXM], v[MAXM], w[MAXM];struct Splay{

ZOJ_2532 A good idea is to enumerate each edge and increase the capacity by 1 to see if the maximum stream is equal to the previous one, but the complexity is too high. So let's try another way of thinking. If the stream is full, we will consider

HDU_2258 I had encountered HDU_2259 in Step, and found that I had to do this first ...... You can simulate the rules described in question detail. #include#include#include#define MAXN 25#define MAXD 410int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1},