UVALive 4394 String painter ——（区间DP）

　　其实这个dp过程有点似懂非懂。。。代码如下：

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
const int N = 100 + 5;

char a[N],b[N];
int dp[N][N];
int f[N];

int main()
{
    while(scanf("%s",a+1) == 1)
    {
        int n = strlen(a + 1);
        scanf("%s",b+1);
        for(int i=1;i<=n;i++) dp[i][i] = 1;
        for(int len=2;len<=n;len++)
        {
            for(int i=1;i+len-1<=n;i++)
            {
                int j = i + len - 1;
                dp[i][j] = dp[i+1][j] + (b[i] == b[i+1] ? 0 : 1);
                for(int k=i+1;k<=j;k++)
                {
                    if(b[k] == b[i])
                    dp[i][j] = min(dp[i][j], dp[i+1][k] + dp[k+1][j]);
                }
            }
        }
        for(int i=1;i<=n;i++)
        {
            if(a[i] == b[i]) f[i] = f[i-1];
            else
            {
                f[i] = 2e9;
                for(int k=i;k>=1;k--)
                {
                    f[i] = min(f[i], f[k-1] + dp[k][i]);
                }
            }
        }
        printf("%d
",f[n]);
    }
    return 0;
}