题目大意:
解题思路:
其实只要注意到,如果数字是连续的,那么第i层与第i+1层的高度差为1,而每次只能翻转1~k层,相当于只能改变第k层与第k+1层的差,即只能改变一个相邻差
IDA*步骤:
- 离散化,然后再考虑估价函数,估价函数显然就是有多少个相邻差不为1的即可,这就是最少翻的次数
- 再将其与剩下可递归层数比较判断是否可行
- 剩下的就是套就完事了
AC代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e2 + 10;
int n, maxd, cur[maxn], goal[maxn];
int h(int *now) {
//离散化之后,改变1~i的序列,只能改变i和i+1的差,所以对于一个序列有多少对相邻差不为1,则为估价函数
//另外cur[n + 1] = n + 1
int cnt = 0;
for (int i = 1; i <= n; ++i)
cnt += (abs(now[i] - now[i + 1]) != 1);
return cnt;
}
void rotate(int *now, int lc, int rc) {
for (int i = lc; i <= (lc + rc) / 2; i++)
swap(now[i], now[rc - i + lc]);
}
void print(int *now) {
for (int i = 1; i <= n; i++)
cout << now[i] << " \n"[i == n];
}
bool dfs(int d) {
if (d == maxd + 1) {
if (!h(cur)) return true;
else return false;
}
if (maxd + 1 - d < h(cur)) return false;
for (int i = 2; i <= n; i++) {
rotate(cur, 1, i);
if (dfs(d + 1)) return true;
rotate(cur, 1, i);
}
return false;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> cur[i], goal[i] = cur[i];
cur[n + 1] = n + 1;
sort (goal + 1, goal + n + 1);
for (int i = 1; i <= n; ++i)
cur[i] = lower_bound(goal + 1, goal + n + 1, cur[i]) - goal;//离散化
for (maxd = 0; ; maxd++) {
if (dfs(1)) {
cout << maxd << endl;
break;
}
}
return 0;
}
/*
4
1 3 4 2
*/