【POJ 3460】 Booksort

【题目链接】

http://poj.org/problem?id=3460

【算法】

IDA*

注意特判答案为0的情况

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;

int i,j,n,step,T;
int a[],b[];

inline bool check()
{
        int i;
        for (i = ; i <= n; i++)
        {
                if (b[i] != i)
                        return false;
        }
        return true;
}
inline int calc()
{
        int i,ret = ;
        for (i = ; i <= n; i++)
        {
                if (b[i] != b[i-] + )
                        ret++;
        }
        return (ret - ) /  + ;
}
inline bool dfs(int dep)
{
        int i,j,k,l;
        int tmp[];
        if (dep == step)
        {
                if (check())
                        return true;
        }
        if (dep + calc() > step) return false;
        for (i = ; i <= n - ; i++)
        {
                for (j = ; j <= n - i; j++)
                {
                        for (k = i + j; k <= n + ; k++)
                        {
                                for (l = ; l <= n; l++) tmp[l] = b[l];
                                for (l = i + j; l < k; l++) b[i+l-i-j] = tmp[l];
                                for (l = k - j; l < k; l++) b[l] = tmp[l-k+i+j];
                                if (dfs(dep+)) return true;
                                for (l = ; l <= n; l++) b[l] = tmp[l];
                        }
                }
        }
        return false;
}

int main()
{

        scanf("%d",&T);
        while (T--)
        {
                scanf("%d",&n);
                for (i = ; i <= n; i++) scanf("%d",&a[i]);
                for (i = ; i <= ; i++)
                {
                        step = i;
                        for (j = ; j <= n; j++) b[j] = a[j];
                        if (dfs())
                        {
                                printf("%d\n",step);
                                break;
                        }    else step = ;
                }
                if (step == ) printf("5 or more\n");
        }

        return ;

}