原题地址
String painter
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3726 Accepted Submission(s): 1740
Problem 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.
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
给你两个字符串,让你从字符串1刷成字符串2的样子,每次你只能将一个区间内的字符刷成同一个字符。
思路:
区间DP。一开始将字符串初始为空串,记dp[ i ][ j ]为,将从 i ~ j 的字符串刷成目标串所用的最少步数。可以将dp[ i ][ j ]初始化为dp[ i-1 ][ j ],然后比较新添加的一位如果和区间内的p位相同,则dp[i][j] = min(dp[i][j],(dp[i+1][p]+dp[p+1][j]))
AC代码:
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
char str1[111],str2[111];
int dp[111][111];
int ans[111];
int main()
{
while(~scanf("%s",&str1))
{
scanf("%s",&str2);
int i,j,l;
l=strlen(str1);
memset(dp,0,sizeof(dp));
for(j=0;j<l;j++)
{
for(i=j;i>=0;i--)
{
dp[i][j]=dp[i+1][j]+1;
for(int p=i+1;p<=j;p++)
{
if(str2[i]==str2[p])
dp[i][j] = min(dp[i][j],(dp[i+1][p]+dp[p+1][j]));
}
}
}
for(int i=0;i<l;i++)
{
ans[i]=dp[0][i];
}
for(int i=0;i<l;i++)
{
if(str1[i]==str2[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[l-1]);
}
return 0;
}