LA 4394 刷字符串

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char str1[1000],str2[1000];int dp[160][160][36];int dfs(int l,int r,int c){if(l>r)return 0;if(dp[l][r][c]!=-1)return dp[l][r][c];if((c==26&&str1[l]==str2[l])||str2[l]==c+'a')return dp[l][r][c]=dfs(l+1,r,c);dp[l][r][c]=1+dfs(l+1,r,c);for(int i=l+1;i<=r;i++)if(str2[l]==str2[i])dp[l][r][c]=min(dp[l][r][c],1+dfs(l+1,i-1,str2[l]-'a')+dfs(i+1,r,c));return dp[l][r][c];}int main(){while(~scanf("%s%s",str1,str2)){int len=strlen(str1);memset(dp,-1,sizeof(dp));printf("%d\n",dfs(0,len-1,26));}}