Use line tree to make leaderboards

First, the user ranking hypothesis is sorted by integral (for convenience of description) the integral range is determined to assume 0 to n

Create a line segment tree for 0 to N

Number of users per segment the leaf node contains only one integer value

Then according to the user score can determine the user ranking, modify the original delete, modify the affected interval

Then add the user to the new interval

Reference article Links:

http://gad.qq.com/article/detail/7082471

Use line tree to make leaderboards