本文介绍了如何利用线段树数据结构和归并排序算法来高效计算序列中的逆序数。逆序数在排序理论中扮演着重要角色，通过线段树可以实现对逆序对的动态查询，而归并排序则可以在排序过程中计算逆序数。这两个技术的结合提供了一种有效的方法来解决这类问题。
如果逆序数大于0，存在1<=i<n，使得交换两个数数后逆序数减少1.
所以答案为max{inversion-k,0}.
经典的分治法复杂度为n*log(n).
bobo has a sequence a
1,a
2,…,a
n. He is allowed to swap two
adjacent numbers for no more than k times.
Find the minimum number of inversions after his swaps.
Note: The number of inversions is the number of pair (i,j) where 1≤i<j≤n and a i>a j.
Find the minimum number of inversions after his swaps.
Note: The number of inversions is the number of pair (i,j) where 1≤i<j≤n and a i>a j.
The first line contains 2 integers n,k (1≤n≤10 5</
最低0.47元/天 解锁文章
扫一扫
644
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
