UVa-11212 Editing a Book

#include <bits/stdc++.h>
#define _for(i,a,b) for(int i = (a);i < (b);i ++)
#define pb push_back
#define is sizeof(int)

using namespace std; 
const int maxn = 9;

int n;
int maxd;
int v[maxn];

int readint() {int tmp;scanf("%d",&tmp);return tmp;}
void read()
{
    int vend = 0;
    _for(i,0,n)
        v[vend++] = readint();
}

int wnc()//wrong number count
{
    int cnt = 0;
    _for(i,1,n)
        if(v[i-1]+1!=v[i])
            cnt ++;
    return cnt;
}

bool dfs(int d)
{
    if(3*d+wnc()>3*maxd) return false;
    if(wnc()==0) return true;
    int vv[maxn];
    memcpy(vv,v,sizeof(v));
    int tmp[maxn];
    _for(i,0,n)//confirm the beginning
    {
        if(i==0 || vv[i] != vv[i-1]+1)
        {
            _for(j,i,n)
            {
                while(j+1<n && vv[j+1]==vv[j]+1) j++;
                memcpy(tmp,vv+i,is*(j-i+1));//move part
                _for(k,j+1,n)
                {
                    while(k+1<n && vv[k+1]==vv[k]+1) k++;
                    memcpy(v+i,vv+j+1,is*(k-j));
                    memcpy(v+i+(k-j),tmp,is*(j-i+1));
                    if(dfs(d+1))return true;
                    memcpy(v,vv,sizeof(v));
                }
            }
        }
    }
    return false;
}

int solve()
{
    if(wnc()==0)    return 0;
    for(maxd = 1; ;maxd ++)
    {
        if(dfs(0)) break;
    }
    return maxd;
}

int kase = 1;
void output(int rnt)
{
    printf("Case %d: %d
",kase++,rnt);
}

int main()
{
    while(~scanf("%d",&n)&&n!=0)
    {
        memset(v,0,sizeof(v));
        read();
        output(solve());
    }
    return 0;
}