Recently, I am reading the tree array questions. I haven't summarized it carefully for a long time. Write something.
1. hdu1166 enemy deployment array http://acm.hdu.edu.cn/showproblem.php? PID = 1166 entry-level simplest tree array question. At that time, the senior student told me about the basic knowledge points of the tree array on the spot and asked me to click this question.
Just set the template directly. There are two operations: Query interval and maintain the tree array.
2. pku2299 ultra-quicksort http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2299 is also a simple tree array question. It can also be sorted by merging. The following two questions are similar, and they are also questions about the number of reverse orders.
3. hdu2689 sort it http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2689
4. hdu1394 minimum inversion number
Http://acm.hdu.edu.cn/showproblem.php? PID = 1394.