摘要: We have some permutation A of [0, 1, ..., N - 1], where N is the length of A. The number of (global) inversions is the number of i < j with 0 <= i < j 阅读全文
posted @ 2018-05-02 23:07 Grandyang 阅读(3327) 评论(4) 推荐(1)
Fork me on GitHub