uva 331

题意：求使序列变成递增序列，有几种交换方式，只能相邻的交换，简单的回溯就可以了

#include <iostream>
#include<fstream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

int arr[10],n,brr[10];
int step ;

bool cmp(const int &a,const int &b)
{
	return a<b;
}

void dfs(int cnt)
{
	if (memcmp(arr,brr,sizeof(brr)) == 0)
	{
		step++;
		return;
	}

	for (int i = 0 ; i < n - 1 ; i++)
	{
		if (arr[i] > arr[i+1])
		{
			int t = arr[i];
			arr[i] = arr[i+1];
			arr[i+1] = t ;
			dfs(cnt+1);
			int t1 = arr[i];
			arr[i] = arr[i+1];
			arr[i+1] = t1 ;
		}
	}
}

int main()
{
	int t = 1;
	while (scanf("%d",&n) != EOF &&  n)
	{
		for (int i = 0 ; i < n ; i++)
		{
			cin>>arr[i];
			brr[i] = arr[i];
		}

		sort(brr,brr+n,cmp);
		step = 0 ;
		if (memcmp(brr,arr,sizeof(brr)))
			dfs(0);
		printf("There are %d swap maps for input data set %d.\n",step,t++);
	}
	return 0;
}