hihocoder1323 回文字符串

#include <bits/stdc++.h>
#define ll long long
#define maxn 110
using namespace std;
char s[maxn];
int dp[maxn][maxn];
inline int f(int l,int r){
    if(l >= r) return 0;
    if(dp[l][r] != -1) return dp[l][r];
    if(s[l] == s[r]) return f(l+1, r-1);
    return dp[l][r] = min(f(l, r-1)+1, min(f(l+1, r)+1, f(l+1, r-1)+1));
}
int main(){
    scanf("%s", s);
    memset(dp, -1, sizeof(dp));
    int l = strlen(s);
    cout<<f(0, l-1)<<endl;
    return 0;
}