UVA 331 Mapping the Swaps

UVA 331 Mapping the Swaps

题意。给一串数字。求其冒泡排序（最少次数的)方案的种数。。

标准的深搜回溯

每次交换值后进行一次judge。如果从小到大了，就种数加1.

#include <stdio.h>
#include <string.h>

int min;
int n;
int num[5];

int judge()
{
    for(int i = 0; i < n-1; i++)
    {
        if(num[i] > num[i+1])
			return 0;
    }
    return 1;
}

void swap(int &a, int &b)
{
    int t = a;
    a = b;
    b = t;
}

void dfs(int *num)
{
    if(judge())
    {
        min ++;
        return ;
    }

    for(int i = 0; i < n-1; i++)
    {
        if(num[i] > num[i+1])
        {
            swap(num[i], num[i+1]);
            dfs(num);
            swap(num[i], num[i+1]);
        }
    }
}

int main()
{
    int t = 1;
    while(scanf("%d", &n) && n)
    {
        min = 0;
        for(int i = 0; i < n; i++) 
			scanf("%d", &num[i]);
        if(judge())
		{
			printf("There are %d swap maps for input data set %d.\n", min, t ++);
		}
		else
        {
            dfs(num);
			printf("There are %d swap maps for input data set %d.\n", min, t ++);
        }
        
    }
    return 0;
}