例题7-10 编辑书稿（Editing a Book, UVa 11212）

1. 三种加速策略都得不到正解？

2. 枚举插入的方式值得学习。

3. 通过打表得出解<=5，进而减少maxd。

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define mod 1000000007
#define INF 1000000007
#define eps 1e-5
#define PI 3.1415926535898
using namespace std;
//-------------------------CHC------------------------------//
const int maxn = 9 + 5;
int n, a[maxn];
int maxd;

bool is_sorted() {
	for (int i = 0; i < n; ++i)
		if (a[i] != i + 1) return false;
	return true;
}

int count() {
	int ret = 0;
	for (int i = 0; i < n - 1; ++i)
		if (a[i] + 1 != a[i + 1]) ret++;
	if (a[n - 1] != n) ret++;
	return ret;
}

bool dfs(int d) {
	if ((maxd - d) * 3 < count()) return false;
	if (d == maxd) return is_sorted();
	int t[maxn], t2[maxn];
	memcpy(t, a, sizeof(a));
	for (int i = 0; i < n; ++i)
		for (int j = i; j < n; ++j) {
			int cnt = 0;
			for (int l = 0; l < n; ++l)
				if (l < i || l > j) t2[cnt++] = a[l];
			for (int l = 0; l <= cnt; ++l) {
				int cnt2 = 0;
				for (int p = 0; p < l; ++p) a[cnt2++] = t2[p];
				for (int p = i; p <= j; ++p) a[cnt2++] = t[p];
				for (int p = l; p < cnt; ++p) a[cnt2++] = t2[p];
				if (dfs(d + 1)) return true;
				memcpy(a, t, sizeof(a));
			}
		}
	return false;
}

void solve() {
	if (is_sorted()) printf("0\n");
	else {
		for (maxd = 1; maxd < 5; ++maxd) {
			if (dfs(0)) {
				printf("%d\n", maxd);
				return;
			}
		}
		printf("5\n");
	}
}

int main() {
	int kase = 1;
	while (scanf("%d", &n) && n) {
		for (int i = 0; i < n; ++i)
			scanf("%d", &a[i]);
		printf("Case %d: ", kase++);
		solve();
	}
	return 0;
}