You are given an array of N integers With each integer a[I], call x is the number of integers before I and larger than a[I] Your task is find the sum of all x

If you know the solution, please give me some ideas about how to implement it. I have just started learning Segment Tree