Others

Poj_3709 This is my first question about slope optimization. The solution below does not involve any basic ideas, but I just talked about my own feelings. Personal perception slope optimization + monotonous queue the most important thing is to

Hdu_1394 This topic can be based on the existing Reverse Order Number pairs to introduce the reverse order number pairs for other cases. Each time we take an element from the beginning, it is equivalent to reducing the number of so many Reverse

Spoj_4560 This question is equivalent to dividing two strings into several equal segments. If two segments are regarded as a group, you can only add one of them to each group, calculate the sum of the final sum and the maximum number. Therefore,

Ural_1020 In fact, the arc part can form a circle, while the straight line part is equal to the distance between two adjacent points. # Include # Include String . H> # Include # Define Maxd 110 Int N; Double R; Const Double Pi = ACOs (-1.

Ural_1012 The idea is the same as ural_1009, but it only requires high precision, so it is written directly in Java. For specific ideas, refer to my ural_1009 question: http://www.cnblogs.com/staginner/archive/2012/05/01/2477513.html. Import

Hdu_3377 This question is essentially a loop problem. To facilitate processing, we can regard the initial state as that there is only a plug in at the top of the upper left corner, at the same time, the lower right corner of the grid can be seen

Hdu_2256 This problem cannot be solved by using the fast power + fmod. It should be because of the floating point precision. The derivation process is reflected in the figure, and the rest of the work is to solve the binary matrix. In addition,

As this game is a directed graph game and conforms to the basic features of a fair combination game, you can directly solve the SG function values of each node. # Include # Include String . H> # Define Maxd 1010 # Define Maxm 2010 Int N, K,

Hdu_4027 This question is a bit like hdu_3954. We can't directly update a section of the question due to the operator, but we will find that even 2 ^ 63 can be opened for a very small number of times, we don't need to update the number after one

Poj_3378 If f [I] [J] is set, it indicates the number of solutions when I is selected as a [J, f [I] [J] is equal to the sum of all f [I-1] [k] That satisfies a [k] In addition, when calculating the intermediate result, 5000 ^ 4 won't exceed

Poj_2888 At the beginning, I was too impetuous to learn polyA. It was just a formula. In fact, it was not based on understanding. Today, I read the black book again, and finally I was able to deduce the polyA formula based on the Burnside theorem.

Poj_2728 The optimal ratio generation tree problem is described in the black book in detail. During the query, you can directly divide K into two parts, or you can first assume a K and then obtain a new K, so that the iteration continues. For

Hdu_2795 Although H has a large range, there is an effective optimization: If H> N, H = N can be directly set, because even if there is only one poster per row, at last, only N rows are occupied. Next, you can think of each row as a point, and

Hdu_1639 This question can be done using the plug DP idea. Because multiple loops are allowed, you only need to use 0 and 1 to record whether there is a plug in each position, then, a valid status is generated gradually and the number of solutions

You can use F [I] [J] to indicate that the optimal solution of the J branches is retained when the node is recursive to the I node. When making a decision, you can only select from a subtree, or select from two subtree at the same time, andIf you

Uestc_1558 If this question does not take t into consideration but is changed to the minimum number of conversions, we can sort all the exchanges by R as long as we increase the number of conversions, you can select the largest exchange value of V

Fzu_1977 For the point that must be taken, there must be a plug at that point. For unnecessary points, ifDPWhen there is no plug at this point, you can either put two plug at this point to open up a new connected component, or do not put the plug,

Poj_3245 This question is very similar to that of poj_3017, but the known restrictions and requirements are reversed. This question is actually very difficult to read, but it is still understandable Based on the hint he gave. I suggest you not

Uestc_1425 For more information about the line segment tree related to interval merging, refer to Hu Hao's blog: http://www.notonlysuccess.com/index.php/segment-tree-complete /. This question is very similar to hdu_3308, but we only need to deal

HDU_3045 After sorting the values at the beginning, this question is basically the same as that of POJ_3709, except that long int is used when reading data from the beginning. The rest of the work is the same as POJ_3709, with slope optimization +