HDU 4911 归并排序题目解析

最新推荐文章于 2022-12-06 07:57:47 发布

原创

最新推荐文章于 2022-12-06 07:57:47 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个利用归并排序解决寻找在允许交换相邻元素不超过k次的情况下，序列中逆序对最小数量的问题。给出了归并排序的代码实现，并强调了代码理解和模板应用的重要性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

上题目

Inversion Time Limit: 2000/1000 MS (Java/Others) Memory Limit:
131072/131072 K (Java/Others) Total Submission(s): 2924 Accepted
Submission(s): 1081

Problem Description bobo has a sequence a1,a2,…,an. 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 ai > aj.

Input The input consists of several tests. For each tests:

The first line contains 2 integers n,k (1≤n≤105,0≤k≤109). The second
line contains n integers a1,a2,…,an (0≤ai≤109).

Output For each tests:

A single integer denotes the minimum number of inversions.

Sample Input
3 1
2 2 1
3 0
2 2 1

Sample Output
1
2