Others

Poj_1180 Let's set T [I] to T1 + T2 +... + Ti, F [I] indicates F1 + F2 +... + Fi. If you calculate based on the formula in the question, f [I] = min {f [J] + (out [J] + S + T [I]-T [J]) * (F [I]-f [J])}, where out [J] indicates the time at which

Hdu_1398 This question can be solved using DP, and f [I] [J] indicates the number of solutions where the nominal value of a coin like I * I is J. To practice generating a function, I wrote it using the idea of generating a function and

Poj_1286 Today, I read 《ProgramIn the polyA counting part of the Integrated Mathematics in design, I came back and found some bare questions for practice. So I started to solve the problem. Calculate the number of cycles of each replacement

Poj_1434 The idea at the beginning was to regard w * D as a volume, so that the cuboid becomes a rectangle, and the volume can be expressed by area. Then, B is discretization, use the line segment tree to calculate how many areas are in each

Hnu_11722 Since the number of hooks A, B, and C can be expressed as a = m ^ 2-N ^ 2, B = 2 * m * n, c = m ^ 2 + N ^ 2, therefore, you can enumerate n to find the number of all possible mutual elements, and then remove the repeated solutions. You

Hdu_1521 For the first time, this question cannot be converted into an exponential generation function in the form of E ^ X. At first, I thought I would try to use an integer fraction to represent the intermediate result, later, we found that we

Hdu_1709 This question is still full of fun, and the weight can be placed on different sides. Therefore, if a function is generated, each item can be constructed as (x ^ (-ai) + 1 + x ^ AI ), then, we can calculate the coefficient of the negative

Hdu_1542 If we expand the left and right sides of the rectangle into a straight line, the plane is divided into several areas, and the area covered by the rectangle in each area is equal to the width of the area multiplied by the AreaYThe length

Hdu_1849 This topic is actually a nim game with N heap stones. For some specific ideas, refer to my other problem-solving Report: http://www.cnblogs.com/staginner/archive/2012/02/24/2366089.html. # Include # Include String . H> Int M; Void Solve

Poj_3580 For more questions about splay practitioners, refer to Hu Hao's Blog Tips. For the add operation, the process is the same as that of the Line Segment tree. You can add an add delay mark. When Pushdown is performed, do not forget that it

Poj_1678 If we connect an edge between two numbers in the range of [a, B], we will find that the process of actually getting the number is a process of walking on a directed acyclic graph, for a point, if you select it and regard the person who

Poj_1113 We can first convert the problem: first obtain the convex hull of each point in the castle, and then find the perimeter of the closed graph with the distance from the convex hull being L. As to why it is converted into a convex hull

Hdu_1890 When the first write involves the splay of interval flip, the result is that the flip operation is similar to the reverse operation on the range 0 and 1 in the line segment tree, when the flag is passed down, the record flip flag rev

Poj_3384 The question refers to arranging two circles in a polygon so that the areas covered by the two circles are as large as possible (the overlapping part is only counted once) and finding the coordinates of the center of the two circles.

POJ_2826 This topic does not discuss accuracy for the time being, because A considerable number of people on discuss are talking about accuracy, so if you cannot drop A, you can consider some suggestions on discuss. This question must be considered

HDU_1010 Because the block can only go through once, we must record the status of each block during the search process, and this question is not directly related to the shortest distance, if you use bfs, you must search for all paths that cannot be

Poj_00005 An intuitive idea is to calculate the sum of the rectangular area once each Query. For details, refer to my POJ_1151 question. That question is also the sum of the rectangular area. However, this takes a long time, and I haven't thought of

POJ_2985 This topic uses the number of cats as the keyword to create a line segment tree. I used SBT to practice the sbt I just learned yesterday. However, SBT is less efficient. #include#include#define MAXD 200010#define MAXM 400010int N, M, T,

 HDU_3397  I feel that the question of this maintenance sequence is to fill in the Code and write the modules for each operation. For more information about interval merging, see hu Hao's blog

SPOJ_1043 Today, we suddenly found that the original GSS series had a total of seven questions. This is one of them. You only need to modify the GGS on the website to find other questions. This question can be done using the line segment tree. A