PAT-A1089. Insert or Merge (25)

根据牛客网的样例可以推出问题来，如果下一步的结果和上一步一样，就再做一步插入。pat的第三个样例也是这样。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;

#define MAX 100+10

int N;
int origin[MAX], changed[MAX];
int tempori[MAX];

int isSame(int a[], int b[])
{
	for (int i = 0; i < N; i++)
	{
		if (a[i] != b[i])
			return 0;
	}
	return 1;
}

int cmp(const void *a, const void *b)
{
	return *(int*)a - *(int*)b;
}

int isInsertSort()
{
	int f = 0;
	for (int i = 1; i <= N-1; i++)
	{
		//xian panduan
		if (isSame(tempori, changed))
		{
			f = 1;
		}
		int t = tempori[i], j;
		for (j = i; j > 0 && tempori[j-1] > t; j--)
		{
				tempori[j] = tempori[j-1];
		}
		tempori[j] = t;

		if (isSame(tempori, changed))
			continue;

		if (1 == f)
			return 1;
	}
	return 0;
}

int isMergeSort()
{
	int f = 0;
	for (int step = 2; step/2 <= N; step *= 2)
	{
		if (isSame(origin, changed))
			f = 1;
		for (int i = 0; i < N; i += step)
		{
			qsort(origin+i, min(step, N-i), sizeof(int), cmp);
		}
		if (1 == f)
			return 1;
	}
	return 0;
}

void printArray(int a[])
{
	for (int i = 0; i < N; i++)
	{
		printf("%d", a[i]);
		if (i != N-1)
			printf(" ");
	}
}

int main()
{
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		scanf("%d", &origin[i]);
		tempori[i] = origin[i];
	}
	
	for (int i = 0; i < N; i++)
	{
		scanf("%d", &changed[i]);
	}
	
	if (isInsertSort())
	{
		printf("Insertion Sort\n");
		printArray(tempori);
	}
	else if (isMergeSort())
	{
		printf("Merge Sort\n");
		printArray(origin);
	}
	return 0;
}