I said yesterday, died today exams are miserable
I do not look at yesterday T1 directly to discard, did not think could last a minimum spanning tree / half
The answer brain supplement gradually expanded the boundaries of the process, found that as long as the moment blocked the upper and lower boundaries, then the maximum distance is the answer
Minimum spanning tree is similar to this procedure, to ensure minimum spanning tree can not be exactly the boundary
T3 is the slope (convex hull) questions, do do to optimize the slope dp before his head fog, and a look ignorant force until the exam came to realize that the slope of the convex hull of this kind of thing
This problem is also a breakthrough contribution formula is proportional, and to a node represented as (dep, c) then contributed two points is the slope
Constantly turn when his father, then a single direct maintenance teams in the chain, in a tree with a single team may persist, in fact, doubling the convex hull maintenance information of each node, each update son
Today the first test match difficulty Province / game system title
A whole pitching, exciting part to play points, the last only 50 minutes rk11
In fact, part of the division is still relatively conscience
Positive Solutions for T1 is not quite easy to understand, easy to think of inclusion and exclusion exam, but it is difficult combinations in the process of inclusion and exclusion are not legitimate side (the bundle was like law, then flapper, so do not be too complicated)
Violence permu + M = 0,1 sentenced hand could get dotted
T2 thought play a lot of it, but burst 0, and died in the Euler go on the road, did not seriously studied before Euler (back) to traverse the road
40 sub-section points did not get a great pity, because the conversion of what is the first question SZN, an odd number of points / 2 is the total number of lines covering
FIG odd number of points must be an even number, if the dotted line between the odd-even point, be able to run Euler