做题笔记16（逆序对）

---

一、题目

二、2-路归并排序

因题目提示可以在归并排序的过程中进行统计，故先回顾归并排序。
归并排序：将有n个元素的初始序列看作n个子序列，两两归并，得到$\lceil \frac{n}{2}\rceil$个长度为2或1的有序子序列，再两两归并，重复至得到一个长度为n的有序序列为止。
核心操作：将一维数组中前后相邻的两个有序序列归并为一个有序序列。

void merge(int* a, int low, int mid, int high);

void mergeSort(int* a, int low, int high)
{
	if (low < high)
	{
		int mid = (low + high) / 2;
		mergeSort(a, low, mid);
		mergeSort(a, mid + 1, high);
		merge(a, low, mid, high);
	}
}

void merge(int* a, int low, int mid, int high)
{
	int temp[10];
	int i, j, k;
	for (i = low, j = mid + 1, k = i; i <= mid && j <= high; k++)
	{
		if (a[i] > a[j])
		{
			temp[k] = a[i];
			i++;
		}
		else if (a[i] < a[j])
		{
			temp[k] = a[j];
			j++;
		}
	}
	while (i <= mid)
	{
		temp[k++] = a[i++];
	}
	while (j <= high)
	{
		temp[k++] = a[j++];
	}
	for (i = low; i <= high; i++)
	{
		a[i] = temp[i];
	}
}

int main()
{
	int a[10] = { 0,1,2,3,4,5,6,7,8,9 };
	mergeSort(a, 0, 9);
	for (int i = 0; i <= 9; i++)
	{
		printf("%d ", a[i]);
	}
}

三、逆序对

只需要在合并两个子序列的时候，记录元素的移动即可。

#pragma warning(disable:4996)
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>

const int maxn = 1e5 + 10;
int a[maxn], mergeTemp[maxn], n;

int Merge(int left, int mid, int right);

int MergeSort(int left, int right)
{
	// TODO: 统计数组 a 上 [left, right) 区间的逆序对个数

	if (left < right)
	{
		int mid = left + (right - left) / 2;
		return  MergeSort(left, mid) + MergeSort(mid + 1, right) + Merge(left, mid, right);
	}
	else
	{
		return 0;
	}
}

int Merge(int left, int mid, int right)
{
	int i, j, k;
	int count = 0;
	for (i = left, j = mid + 1, k = i; k <= right; k++)
	{
		if ((j > right) || ((i <= mid) && (a[i] <= a[j])))
		{
			mergeTemp[k] = a[i++];
		}
		else
		{
			mergeTemp[k] = a[j++];
			count += mid - i + 1;
		}
	}
	for (int i = left; i <= right; i++)
	{
		a[i] = mergeTemp[i];
	}
	return count;
}

int main()
{
	while (scanf("%d", &n) != EOF)
	{
		for (int i = 0; i < n; i++)
			scanf("%d", &a[i]);
		printf("%d\n", MergeSort(0, n - 1));
	}
	return 0;
}