紫书 编辑书稿 UVa11212

#include<iostream>
#include<string>
#include<cassert>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<set>
#include<queue>
#include<unordered_map>
using namespace std;
unordered_map<int, int>vis;
void init_lookup_table() {
    vis.clear();
}
int para[10][10];
void decode(int code, int s[], int n)
{
    for (int i = n - 1; i >= 0; ++i)
    {
        s[i] = code % 10;
        code /= 10;
    }
}
int encode(int s[], int n)
{
    int v = 0;
    for (int i = 0; i < n; ++i)
    {
        v = v * 10 + s[i];
    }
    return v;
}
int try_to_insert(int s[],int n,int depth)
{
    int value = encode(s, n);
    if (vis.find(value)==vis.end() || vis[value] > depth)
    {
        vis[value] = depth;
        return 1;
    }
    return 0;
}
int ans;
int ida(int depth, int n, int maxd)
{
    if (depth == maxd)
    {
        int final = encode(para[depth], n);
        return final == ans ? depth : -1;
    }
    int disordernum = 0;
    for (int i = 0; i < n - 1; ++i)
        if (para[depth][i] + 1 != para[depth][i + 1])
            ++disordernum;
    if (para[depth][n - 1] != n)++disordernum;
    int temp[10];
    if (3 * maxd - disordernum < 3 * depth)
        return -1;
    for(int i = 0; i < n; ++i)
    {
        if (i!=0&& para[depth][i - 1] == para[depth][i] - 1 && i != n - 1)
            continue;
        for (int j = i + 1; j <= n - 1; ++j)
        {
            int maxk = min(n - j, n - i);
            for (int k = 1; k <= maxk; ++k)
            {
                memcpy(temp, para[depth], sizeof(temp));
                memcpy(temp + i, para[depth] + j, sizeof(int) * k);
                memcpy(temp + i + k, para[depth] + i, sizeof(int) * (j - i));
                memcpy(para[depth+1], temp, sizeof(temp));
               /* cout << "depth=" << depth << ", maxd=" << maxd << endl;
                for (int cnt = 0; cnt < n; ++cnt)
                    cout << para[depth+1][cnt] << " ";
                cout << "  (i=" << i << ",j=" << j << ",k=" << k << endl;
                */
                if (try_to_insert(temp, n,depth))
                {
                    int ok= ida(depth+1, n, maxd);
                    if (ok != -1)
                        return ok;
                }
            }
            
        }
    }
    return -1;
}
int main() {
    int kase = 1,n;
    //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout);
    while (scanf("%d",&n)&&n!=0) {
        ans = 0;
        for (int i = 0; i < n; ++i)
        {
            scanf("%d", &para[0][i]);
            ans = ans * 10 + (i + 1);
        }
        int maxd;
        int ok;
        for (maxd = 0; maxd <= n - 1; ++maxd)
        {
            init_lookup_table();
            try_to_insert(para[0], n,0);
            if ((ok = ida(0, n, maxd)) != -1)
                break;
        }
        printf("Case %d: %d\n",kase++,ok) ;
    }
}