POJ 2388 1804 2299 排序 （逆序数 归并排序）

 

POJ 1804 求逆序数 直接 冒泡水、其实只需要统计 逆序的就可以了 不需要这么复杂

#include <iostream>
using namespace std;
int num[1001];
int main()
{
	int t,n,i,j,temp,Case=0,step;
	scanf("%d", &t);
	while(t--)
	{
		scanf("%d", &n);
		for(i=0; i<n; i++)
			scanf("%d",&num[i]);
		for(i=0,step=0; i<n; i++)
		for(j=0; j<n-i-1; j++)
		{
			if(num[j]>num[j+1])
			{
				temp = num[j+1];
				num[j+1] = num[j];
				num[j] = temp;
				step++;
			}
		}
		printf("Scenario #%d:\n%d\n\n",++Case, step);
	}
	return 0;
}

POJ 2299 归并排序 如果动态申请空间 将 多花费1S多的时间

#include <iostream>
using namespace std;
int num[500010],temp[500010];
__int64 ans;
void merge(int array[], int low, int mid, int high)
{
	int begin1 = low, end1 = mid,k;
	int begin2 = mid+1, end2 = high;
	for(k=0; begin1<=end1 && begin2<=end2; k++)
	{
		if(array[begin1]<=array[begin2])
		{
			temp[k] = array[begin1++];
		}
		else 
		{
			ans += end1 - begin1+1;
			temp[k] = array[begin2++];
		}
	}
	if(begin1 <= end1)
	{
		memcpy(temp+k, array+begin1, (end1-begin1+1)*sizeof(int));
	}
	if(begin2 <= end2)
	{
		memcpy(temp+k, array+begin2, (end2-begin2+1)*sizeof(int));
		
	}
	memcpy(array+low, temp, (high-low+1)*sizeof(int));
}
void merge_sort(int array[], unsigned int first, unsigned int last)
{
	
	if(first<last)
	{
		int mid = (first+last)/2;
		merge_sort(array, first, mid);
		merge_sort(array, mid+1, last);
		merge(array, first, mid, last);
	}
	return ;
}
int main()
{
	int i,n;
	while(scanf("%d", &n),n)
	{
		ans=0;
		for(i=1; i<=n; i++)
			scanf("%d", &num[i]);
		merge_sort(num, 1, n);
		printf("%I64d\n", ans);
	}
	return 0;
}