80求救

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=75;
char s[N];
int f[N][N];
int main(){
	//freopen("a.in","r",stdin);
	//freopen("a.out","w",stdout);
	scanf("%s",s+1);
	int n=strlen(s+1);
	//if(s[n]=='\n')n--;
	memset(f,0x7f,sizeof(f));
	for(int i=1;i<=n;i++)f[i][i]=1;
	for(int len=1;len<=n;len++){
		for(int l=1;l+len<=n;l++){
			int r=l+len;
			if(s[r]==s[r-1]||s[r]==s[l])f[l][r]=min(f[l][r],f[l][r-1]);
			else f[l][r]=min(f[l][r],f[l][r-1]+1);
			if(s[l]==s[l+1]||s[l]==s[r])f[l][r]=min(f[l][r],f[l+1][r]);
			else f[l][r]=min(f[l][r],f[l+1][r]+1);
		}
	}
	printf("%d\n",f[1][n]);
	return 0;
}