HDU 2476 String painter区间dp

String painter

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 2476

Description

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

Sample Output

6
7

题意：

让一串刷成二串，最少的刷的次数

思路：

a：首先处理二串（目标串）对于一个新来的区间，新来的一个字符，我先让它默认刷一次

b：然后枚举区间中间的k如果第k个和新来的一样，我就可以让它少一次

if(s2[i]==s2[k])dp[i][j] = min(dp[i][j],(dp[i+1][k]+dp[k+1][j]));

c：二串处理完就是一串了，现在如果二串和一串的对应位置相等，那么就可以少刷那么一次。否则就去找 ans [ i ] = min ( ans [ i ], ans [ j ]+ dp [ j +1 ][ i ]);

慢慢理解。。。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s1[105],s2[105];
int dp[105][105];
int ans[105];
int main() {
    while(~scanf("%s%s",s1,s2)) {
        int len = strlen(s1);
        memset(dp,0,sizeof(dp));
        for(int j = 0; j<len; j++) {
            for(int i = j; i>=0; i--) {
                dp[i][j] = dp[i+1][j]+1;
                for(int k = i+1; k<=j; k++) {
                    if(s2[i]==s2[k])dp[i][j] = min(dp[i][j],(dp[i+1][k]+dp[k+1][j]));
                }
            }
        }
        for(int i = 0; i<len; i++)ans[i] = dp[0][i];
        for(int i = 0; i<len; i++) {
            if(s1[i] == s2[i])ans[i] = ans[i-1];
            else {
                for(int j = 0; j<i; j++)
                    ans[i] = min(ans[i],ans[j]+dp[j+1][i]);
            }
        }
        printf("%d\n",ans[len-1]);
    }
    return 0;
}