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

本文介绍了一种使用归并排序算法处理整数序列的解决方案,通过计算逆序对的数量来确定将序列排序所需的最少操作次数。该算法适用于不超过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

3
1 2 3
4 
4 3 2 1 

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;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值