The ranking of K-plus numbers and given numbers in variable (add and delete) interval Elements

Thought comes from the power of statistics by Zhang kunwei

The Division tree can only calculate the k-th largest number and the given number ranking in the static interval.

Based on the dynamic nature of letters and numbers, as long as the number of strings (in the binary form of numbers) ending with the current node is stored on the node, and the number of strings prefixed with this string, you can add, delete, and solve the above problems in the in-place mode for a long time. However, when the element value is too large, the time constant may be too large, and it is not easy to estimate the spatial demand.