UVALive 4394 String painter ——（区间DP）

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

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

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

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