HDU 2689 【归并排序求逆序对】

最新推荐文章于 2022-03-15 00:12:02 发布

神探小小迪

最新推荐文章于 2022-03-15 00:12:02 发布

阅读量198

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构----排序数据结构

本文链接：https://blog.youkuaiyun.com/qq_37867156/article/details/82861070

数据结构同时被 2 个专栏收录

155 篇文章

订阅专栏

数据结构----排序

5 篇文章

订阅专栏

本文介绍了一种使用归并排序算法处理整数序列的解决方案，通过计算逆序对的数量来确定将序列排序所需的最少操作次数。该算法适用于不超过1000个元素的序列，能够有效地找出序列中需要交换的元素对，从而达到升序排列的目标。

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

You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. Then how many times it need.
For example, 1 2 3 5 4, we only need one operation : swap 5 and 4.

Input

The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n <= 1000); the next line contains a permutation of the n integers from 1 to n.

Output

For each case, output the minimum times need to sort it in ascending order on a single line.

Sample Input

Sample Output

0
6

题解：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 1005;
int n, ans;
int a[maxn], b[maxn];

void Merge_Sort(int l, int r){
    if(l < r){
        int mid = (l+r) / 2;
        int i = l, j = mid+1, id = l;
        Merge_Sort(l, mid);
        Merge_Sort(mid+1, r);
        while(i <= mid && j <= r){
            if(a[i] <= a[j]) b[id++] = a[i++];
            else b[id++] = a[j++], ans += mid - i + 1;//a[i~mid]都比a[j]要打，所以产生mid-i+1个逆序对
        }
        while(i <= mid) b[id++] = a[i++];
        while(j <= r) b[id++] = a[j++];
        for(int k = l; k <= r; k++) a[k] = b[k];
    }
}
int main()
{
    while(~scanf("%d", &n)){
        ans = 0;
        memset(b, 0, sizeof b);
        memset(a, 0, sizeof a);
        for(int i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        Merge_Sort(1, n);
        printf("%d\n", ans);
    }
    return 0;
}