AcWing 788. 逆序对的数量[D4](12.20)

最新推荐文章于 2024-07-12 16:16:27 发布

Ykp想睡觉

最新推荐文章于 2024-07-12 16:16:27 发布

阅读量64

点赞数

分类专栏：算法基础学习文章标签： python 算法

本文链接：https://blog.csdn.net/counting_stars1/article/details/128439685

版权

算法基础学习专栏收录该内容

8 篇文章 0 订阅

订阅专栏

788. 逆序对的数量 - AcWing题库

改进归并即可

def merge(li, low, mid, high, lis):
    i = low
    j = mid + 1
    ltmp = []
    m = 0
    while i <= mid and j <= high:
        if li[i] <= li[j]:
            ltmp.append(li[i])
            i += 1
        else:
            ltmp.append(li[j])
            j += 1
            m += mid - i + 1
    while i <= mid:
        ltmp.append(li[i])
        i += 1
    while j <= high:
        ltmp.append(li[j])
        j += 1
    li[low: high + 1] = ltmp
    if m != 0:
        lis.append(m)


def mergesort(li, low, high):
    if low < high:
        mid = (low + high) // 2
        mergesort(li, low, mid, )
        mergesort(li, mid + 1, high, )
        merge(li, low, mid, high, lis)


if __name__ == "__main__":
    n = input()
    ls = list(map(int, input().split()))
    p = 0
    lis = []
    mergesort(ls, 0, len(ls) - 1)
    for i in lis:
        p += i
    print(p)