HDU 4911 归并排序题目解析

本文主要是介绍HDU 4911 归并排序题目解析，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

上题目

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

翻译

鉴于本人弱菜的英语 翻译一下题意

第

这篇关于HDU 4911 归并排序题目解析的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---