//The questions that don't have time to write here will definitely take time to write;
On the first day, zrt went to talk about data structure;
The headquarters, the southern school, the first middle school, and the friends from the attached middle school are all here...
First, I reviewed the data structure of the winter vacation (I found that I forgot Orz);
It seems that the first time I heard about the rank-by-rank merging of the union search set, the amortized complexity of each find is reduced to O(α(N)), and α(N) is an inverse Ackerman function (RE Tarjan proposed that the approximation is a constant);
The line segment tree has a good question, but it was too troublesome and time was too tight, so I didn't do it, I left an address for CPU monitoring , and I wrote a solution when I had time (must!);
There is a question POJ2828 I wrote about, the title is good, so I summed it up; if you are interested, take a look (strongly recommended) Buy Tickets ;
There is also a line segment tree question that seems to be more troublesome, let's not write 2957: Building reconstruction ;
By the way, I learned about the left-biased tree. For the basic explanation, see the blog. Left- biased tree poj3016 Left-biased tree problem (to be done) APIO dispatch (to be done);
【To be added】