uva 331 Mapping the Swaps

迭代加深搜索。。。

//
//  main.cpp
//  uva 331 - Mapping the Swaps
//
//  Created by XD on 15/8/8.
//  Copyright (c) 2015年 XD. All rights reserved.
//

#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include<vector>
#include <string.h>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cstdio>
using namespace std ;
int maxd ;
int num ;
int n ;
int casenum ;
int solved ;
int a[6] ;

void myswap(int *a , int *b)
{
    int temp = *a ;
    *a = *b ;
    *b = temp ;
}

void  dfs(int d)
{
    if (d == maxd) {
        for (int i = 0; i <n-1; i++) {
            if (a[i] > a[i+1]) {
                return ;
            }
        }
    
        num++ ;
        return ;
    }
    for (int i = 0;i < n-1 ; i++) {
        myswap(&a[i] , &a[i+1]) ;
        dfs(d+1) ;
        myswap(&a[i], &a[i+1]) ;
        
    }
    
    
}

void solve()
{
    int flag =1 ;
    for (int i = 0; i <n-1; i++) {
        if (a[i] > a[i+1]) {
            flag = 0 ;
            break  ;
        }
    }
    if (flag ) {
        printf("There are 0 swap maps for input data set %d.\n",++casenum) ;
        return ;
    }
    for (maxd =1;; maxd++) {
        num = 0 ;
        dfs(0) ;
        if (num >  0 ) {
            printf("There are %d swap maps for input data set %d.\n" , num ,++casenum ) ;
            return ;
        }

    }
}



int main(int argc, const char * argv[]) {
    while (scanf("%d" ,&n)==1 && n!= 0) {
        for (int i =0 ;i <  n ; i++) {
            scanf("%d",&a[i]) ;
        }
        solve() ;
    }
    return 0;
}