1. d为当前深度,maxd为深度限制,因为每次剪切时h最多减少3,所以
时剪枝
的意思是消除h个后继不正确的数字,至少需要步
2. 为何h每次剪切最多减少3
// https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa11212.cpp
// UVa11212 Editing a Book
// Rujia Liu
// This implementation is not very fast, but easy to understand
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 9;
int n, a[maxn];
bool is_sorted() {
for(int i = 0; i < n-1; i++)
if(a[i] >= a[i+1]) return false;
return true;
}
// the number of integers with incorrect successor
int h() {
//cnt统计有多少个数字的后继不对
int cnt = 0;
for(int i = 0; i < n-1; i++)
if(a[i]+1 != a[i+1]) cnt++;
if(a[n-1] != n) cnt++;
return cnt;
}
bool dfs(int d, int maxd) {
if(d*3 + h() > maxd*3) return false;
if(is_sorted()) return true;
int b[maxn], olda[maxn];
memcpy(olda, a, sizeof(a));
for(int i = 0; i < n; i++)
for(int j = i; j < n; j++) {
// cut 剪切
int cnt = 0;
for(int k = 0; k < n; k++)
// 将[i, j]剪切出来,剩余部分concatenate之后放在b数组
// cnt统计一共剪切出了几个
if(k < i || k > j) b[cnt++] = a[k];
// insert before position k
for(int k = 0; k <= cnt; k++) {
int cnt2 = 0;
//其实就是用新的排序覆盖了a数组,可以看成:
//1)先把a数组清零
//2)将b数组中前k个放在a数组最前面
//3)将原a数组(olda)[i,j]的元素放在a数组k个之后
//4)将b数组第k个之后的放在a数组最后面
for(int p = 0; p < k; p++) a[cnt2++] = b[p];
for(int p = i; p <= j; p++) a[cnt2++] = olda[p];
for(int p = k; p < cnt; p++) a[cnt2++] = b[p];
if(dfs(d+1, maxd)) return true;
// 恢复a数组
memcpy(a, olda, sizeof(a));
}
}
return false;
}
int solve() {
if(is_sorted()) return 0;
int max_ans = 5; // after experiments, we found ans <= 5 for n <= 9
for(int maxd = 1; maxd < max_ans; maxd++)
if(dfs(0, maxd)) return maxd;
return max_ans;
}
int main() {
int kase = 0;
while(scanf("%d", &n) == 1 && n) {
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
printf("Case %d: %d\n", ++kase, solve());
}
return 0;
}