求数组中的逆序对数目（POJ1007）

这个题真心写丑了，不过当做练习还是很不错的。

思想就是利用归并排序的办法，先计算左右两个子数组的逆序对数目，把他们加起来。然后用两个指针指向子数组的头，如果前面的子数组目前元素较大，就把后面子数组的头部元素插入结果数组；否则，前面的元素应该进入结果数组了，此时，结果数组里的后面子数组元素个数即为此元素造成的逆序对的个数。

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;

struct Data {
	string DNA;;
	int rev;
	bool operator<(const Data &b) const {
		return rev < b.rev;
	}
};

int calRev(char *s, int start, int end) {
	if (start >= end)
		return 0;
	int mid = start + (end - start) / 2;
	int res = calRev(s, start, mid) + calRev(s, mid + 1, end);
	int i = start, j = mid + 1;
	char *tmp = new char[end - start + 1];
	int curr = 0;
	while (i <= mid && j <= end) {
		if (s[i] > s[j]) {
			tmp[curr++] = s[j];
			j++;
		}
		else {
			tmp[curr++] = s[i];
			i++;
			res += j - (mid + 1);
		}
	}
	while (i <= mid) {
		tmp[curr++] = s[i];
		res += end - mid;
		i++;
	}
	while (j <= end) {
		tmp[curr++] = s[j];
		j++;
	}
	for (int i = 0; i < end - start + 1; ++i)
		s[start + i] = tmp[i];
	delete tmp;
	return res;
}

void cal(Data &myData) {
	char *c = new char[myData.DNA.length() + 1];
	strcpy(c, myData.DNA.c_str());
	myData.rev = calRev(c, 0, myData.DNA.length() - 1);
	delete c;
}

int main()
{
	int m, n;
	cin >> n >> m;
	Data *data = new Data[m];
	for (int i = 0; i < m; ++i) {
		cin >> data[i].DNA;
		cal(data[i]);
	}
	stable_sort(data, data + m);
	for (int i = 0; i < m; ++i)
		cout << data[i].DNA << endl;
	return 0;
}

http://bailian.openjudge.cn/practice/1007/