HDU 4911 Inversion (归并排序求逆序对）

最新推荐文章于 2022-01-13 21:31:32 发布

wdkirchhoff

最新推荐文章于 2022-01-13 21:31:32 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 C程序练习文章标签： HDU 归并排序逆序对

本文链接：https://blog.youkuaiyun.com/wdkirchhoff/article/details/41864723

C程序练习同时被 2 个专栏收录

44 篇文章

订阅专栏

算法

38 篇文章

订阅专栏

本文探讨了通过交换相邻元素来最小化序列中逆序对数量的问题，并提供了一个使用归并排序思想实现的具体算法示例。该算法适用于限制次数内的交换操作。

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

Inversion

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1898 Accepted Submission(s): 743

Problem Description

bobo has a sequence a₁,a₂,…,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.

Input

The input consists of several tests. For each tests:

The first line contains 2 integers n,k (1≤n≤10⁵,0≤k≤10⁹). The second line contains n integers a₁,a₂,…,a_n (0≤a_i≤10⁹).

Output

For each tests:

A single integer denotes the minimum number of inversions.

Sample Input

Sample Output

1
2

#include<iostream>
#include<string.h>
using namespace std;
#define MAX 100010
int aux[MAX];
int a[MAX];
int n;
long long k;
long long ans=0;
void merge(int a[],int l,int mid,int h){
    int i=l;
    int j=mid+1;
    for(int k=l;k<=h;++k){
        aux[k]=a[k];
    }
    for(int k=l;k<=h;k++){
        if(i>mid)a[k]=aux[j++];
        else if(j>h)a[k]=aux[i++];
        else if(aux[i]<=aux[j])a[k]=aux[i++];
        else
        {
            a[k]=aux[j++];
            ans+=(mid-i+1);
        }
    }
}
void mergesort(int a[],int l,int h){
    if(h<=l)return ;
    int mid=l+(h-l)/2;
    mergesort(a,l,mid);
    mergesort(a,mid+1,h);
    merge(a,l,mid,h);
}
int main(int argc, char *argv[])
{
    //freopen("4911.in","r",stdin);
    while(scanf("%d %lld",&n,&k)!=EOF){
        ans=0;
        memset(aux,0,sizeof(aux));
        for(int k=0;k<n;++k)
            scanf("%d",&a[k]);
        mergesort(a,0,n-1);
        if(k<ans)printf("%lld\n",ans-k);
        else
            printf("0\n");
    }
    return 0;
}

记得要把ans和k定义为long long