Because many questions about the line segment tree and tree array can be solved using either of these two methods, it is decided that the two data structures are synchronized and crossover for learning and refreshing questions.
MATERIALS:
Notonlysuccess blog
Tree array-Wu Hao
Line Segment tree and tree array -- Guo Wei
Single point update
HDU 1166 enemy deployment line tree | tree array.
HDU 1754 I hate it line segment tree, calculate the Maximum/minimum value of the Interval
Poj 3264 balanced lineup line segment tree, which is similar to the same as above. The maximum and minimum values must be obtained simultaneously.
HDU 1394 minimum inversion number line segment tree | tree array to find the number of reverse orders. This sequence is used for consecutive 0 ~ N-1 can be recursive.
HDU 2795 billboard line segment tree
Poj 2352 stars line segment tree | tree Array
Poj 2481 cows line segment tree | tree array. It is a bit like the previous question.
Poj 3067 an line segment tree | tree Array
Poj 2299 ultra-quicksort line segment tree | tree array, which is used to calculate the number of reverse orders through discretization
HDU 2689 sort it after changing the vest to the HDU
The CF 6e exposition line segment tree calculates rmq and then enumerates the start point and the second end point query interval. However, rmq is still highly efficient with the st algorithm, but it is only recently learning the line segment tree.
Segment update
HDU 1698 just a hook
HDU 1556 color the ball line segment tree | tree array, simple question
Poj 3468 a simple problem with integers line segment tree, segment update, interval summation, simple question
Zoj 1610 count the colors line segment tree, segment update dyeing, note that the interval is not vertex Dyeing
Poj 2528 mayor's posters is similar to the previous question, but the question is verbose and discretization is required.
Ural 1019 a line painting is similar to zoj1610. For discretization, add 0 and 10 ^ 9.