String painter HDU - 2476 区间dp

There are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can change a segment of characters of a string to any other character you want. That is, after using the painter, the segment is made up of only one kind of character. Now your task is to change A to B using string painter. What’s the minimum number of operations?
Input
Input contains multiple cases. Each case consists of two lines:
The first line contains string A.
The second line contains string B.
The length of both strings will not be greater than 100.
Output
A single line contains one integer representing the answer.
Sample Input
zzzzzfzzzzz
abcdefedcba
abababababab
cdcdcdcdcdcd

先求出空串到s2的花费，对于区间[l,r[]来说，如果s2[l]==s2[k]的话，说明l到k不用刷，dp[l][r]=dp[l+1][k]+dp[k+1][r]
再求s1到s2，如果s1[i]=s2[i]，那从f[i-1]到f[i]的花费一样,再假设后面全部要刷，即全是空串

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<map>
#include<iostream>
#include<math.h>
#include<queue>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
const int N=105;
typedef long long ll;
int dp[N][N],f[N];
char a[N],b[N];
int main()
{
    int t;
    while(~scanf("%s%s",a,b))
    {
        int len,i,j,k;
        memset(dp,0,sizeof(dp));
        int n=strlen(a);
        for(int i=0; i<n; i++)
            dp[i][i]=1;
        for(len=2; len<=n; len++)
        {
            for(i=0; i+len-1<n; i++)
            {
                int j=i+len-1;
                dp[i][j]=dp[i+1][j]+1;
                for(k=i+1; k<=j; k++)
                {
                    dp[i][j]=min(dp[i][j],dp[i+1][k]+dp[k+1][j]+(b[i]!=b[k]));
                }
            }

        }
        for(int i=0; i<n; i++)
        {
            f[i]=dp[0][i];
            if(a[i]==b[i])
            {
                if(i==0) f[i]=0;
                else f[i]=f[i-1];
            }
            for(int k=0; k<i; k++)
                f[i]=min(f[i],f[k]+dp[k+1][i]);
        }
        printf("%d\n",f[n-1]);
    }

    return 0;
}