Others

Uva_11991 Sort all values in order, and the rest of the work will be easier. # Include # Include String . H> # Include # Define Maxd 100010 Struct Point { Int ID, V; Bool Operator Const Point & T) Const { If (V = T. V) Return ID T.

Hdu_2269 Alas, it was wrong to understand this sentence. Wa is dead ...... "Then M line follows, each line containsSeveral things, Which means ifThese thingsStay together without the farmer, some thing will been eaten. "This sentence means that a

Uva_11401 It seems difficult to simply count valid triangles. However, if the statistic is invalid, it is easier to do this because an invalid triangle is equivalent to finding any two edges A and B, and the other side C must satisfy the

Uvalive_4975 You can useManacherAlgorithmPreprocess the retrieval radius ri at each character I, that is, the largest Ri makes the I-ri ~ The I + Ri-1 forms the input string. Then enumerate each character IWwrwwrInWWRAnd then find the smallest J

Hdu_2704 Since N is very small, it should be able to dye each lattice after discretization. One of the better efficiency methods is to use the line segment tree + scanning line (of course, you can also discretization, but this question W, H is

Hdu_2376 For any subtree, there are two types of paths with the root node as the shortest point. One is the path with the root node as the endpoint, the other type is the path of the root node but the endpoint is in the two subtree respectively.

Hdu_1813 A feasible approach is to iterate and deepen the search. In the search process, select four operations in alphabetical order, and then perform the move operation with all spaces, if all spaces are finally moved to the edge, it means that

Poj_3666 Since increment and decrease are similar, we will only discuss the situation of ascending sequence. We can use F [I] [J] to represent the minimum cost required for Recursion to the number of I to F [I] [J] = STD: min (F [I-1] [J] +

Hdu_1667 If we are sure we want to move a class of integers, the other two integers can be regarded as 0, so we can fix the final state of the eight integers in the middle as 1 and the other integers as 0, then all possible states are

Hdu_2295 For the first time, I officially wrote dancing links to solve the problem of repeated coverage. I feel that, compared with precise coverage, precise coverage requires that each column can have only one and one, therefore, when deleting a

Hdu_3053 This question and poj_1160 is almost the same, specific ideas can refer to my poj_1160 question: http://www.cnblogs.com/staginner/archive/2012/03/12/2391925.html? Updated = 1. # Include # Include String . H> # Include # Define Maxd 301

Hdu_3338 As for how to create a picture, you can find it in other blogs (the problem solving of network streams is really hard to write, so this time I am so lazy ......), However, it is worth mentioning that, as most blogs have said, each blank

Hdu_1430 At first, I thought it was just a simple BFs. I found that the writing times out. That is to say, although there are not many statuses in total, there are many cases. A better way to deal with such situations is to pre-process them, then

Hdu_3251 The minimum cut can be used for this question. The cost of the edge on the source image is used as the capacity. In addition, each selectable vertex and T are connected, and the capacity is the point right, in this way, the vertex is

POJ_3498 At any point, the limit is the number of penguins to jump. If this point is not the end point, the penguins to jump will jump, therefore, the actual limit is the number of penguins passing through this point, so that the number of penguins

SPOJ_371 BOXES This question is almost the same as that of HDU_2282. We can treat every "redundant" ball as a research object, so it has several choices, that is, moving to several vacancies, in this way, the redundant ball is regarded as a group,

SPOJ_839 OPTM First, it is difficult to intuitively disagree or perform operations, so we may split mark into 31 bits and solve each bits. The problem becomes that the vertex label can be 1 or 0, and the edge weight is the smallest. Therefore, the

SGU_326 This topic is basically the same as OJ's 1124, except that there are more games outside the team. For games outside the team, you only need to win all the 1st groups and lose all the other groups, the rest is the same as WOJ_1124. For

HDU_3475 Because the status of each lamp may control the status of the eight lights around it, it is necessary to record the status information of at least two lights during dp, by enumerating the operations on the current row, all the lights in the

POJ_3680 The first thought was to put the interval on one side, and then place the vertex on the other side. The interval and the covered vertex are connected to the other side for fee flow, but this is obviously wrong, because the edge of the