Cast

堆栈溢出gomhttp://www.bitscn.com/network/hack/201002/180562.html

Recall the problem of finding the number of inversions. As in the course, we are given a sequence of n numbers a 1 ,··· ,a n , which we assume are all distinct, and we difine an inversion to be a pair