hdu 2476 String painter(区间DP)

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 110
using namespace std;

int a[MAXN];
int dp[MAXN][MAXN];
char str1[MAXN], str2[MAXN];

int main(void) {
while(~scanf("%s%s", str1, str2)) {

int len = strlen(str1);
memset(dp, 0, sizeof(dp));
memset(a, 0, sizeof(a));
for(int i=0; i<len; ++i) {
dp[i][i] = 1;
}

for(int i=len-1; i>=0; --i) {
for(int j=i+1; j<len; ++j) {
dp[i][j] = dp[i+1][j]+1;
for(int k=i+1; k<=j; ++k) {
if(str2[i] == str2[k])
dp[i][j] = min(dp[i][j], dp[i+1][k-1]+dp[k][j]);
}
//printf("%d\n", dp[i][j]);
}
}

for(int i=0; i<len; ++i) {
a[i] = dp[0][i];
if(str1[i] == str2[i]) {
if(i == 0)
a[i] = 0;
else a[i] = a[i-1];
} else {
for(int j=0; j<i; ++j) {
a[i] = min(a[i], a[j]+dp[j+1][i]);
}
}
}
printf("%d\n", a[len-1]);
}
return 0;
}