@[小豆子范德萨](/user/82221) 明显dp吧？
by liqingyang @ 2020-04-19 21:18:47
@[小豆子范德萨](/user/82221) 可以的，我就是用搜索做出来的
by h1910819075 @ 2021-03-23 16:36:03
可以：
```cpp
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n;
char a[N];
int f[N][N];
int dfs(int l, int r) {
if (f[l][r] != -1) return f[l][r];
if (l >= r) return 0;
if (a[l] == a[r]) return f[l][r] = dfs(l + 1, r - 1);
return f[l][r] = 1 + min(dfs(l, r - 1), dfs(l + 1, r));
}
int main() {
memset(f, -1, sizeof(f));
scanf("%s", a + 1);
n = strlen(a + 1);
cout << dfs(1, n) << endl;
return 0;
}
```
by liuzimingc @ 2022-03-12 07:57:10