(HDU - 2476)String painter
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4737 Accepted Submission(s): 2227
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.
Output
A single line contains one integer representing the answer.
Sample Input
zzzzzfzzzzz
abcdefedcba
abababababab
cdcdcdcdcdcd
Sample Output
6
7
题目大意:有两个字符串a,b,每次可以刷字符串a的一段区间把这段区间变成任意字符,问最少需要操作多少次能把a变成b。
思路:把不同字母看成不同颜色,那么问题就是每次可以用一种颜色画一段区间。先考虑最极端的情况,就是a中没有一个位置的颜色和b相同也就相当于从空白开始刷成b。这就和我之前做过的穿衣服那题很类似几乎可以说是一模一样。附上链接:穿衣服。 如果把衣服也看成颜色,每个时间点最外面只有一种颜色,按照时间点把最外面的颜色排成一排这变成了这个问题。所以该问题的一部分解决了,直接那题的代码拿来改一下就好了。
接下来的问题就是适当的推广了,考虑a,b在某些位置存在相同的颜色,考虑这对答案带来的影响。新开数组ans[i]记录a到第i个位置画成和b一样需要的最少操作次数。如果有a[i]==b[i],那么这个位置的存在不影响答案,显然有ans[i]=ans[i-1];如果a[i]!=b[i],就相当于后面有一段可以根据前面预处理出来的开始没有颜色刷成b一样来做,那么可以得到状态转移方程ans[i]=min{ans[j]+f[j+1][i]}(其中i<=j< i)。而最终的答案就是ans[n]。
递推写法:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
const int maxn=105;
char a[maxn],b[maxn];
int f[maxn][maxn],ans[maxn];
int main()
{
while(~scanf("%s%s",a+1,b+1))
{
memset(f,0,sizeof(f));
memset(ans,0,sizeof(ans));
int len=strlen(a+1);
for(int i=1;i<=len;i++) f[i][i]=1;
for(int l=2;l<=len;l++)
for(int i=1;i+l-1<=len;i++)
{
int j=i+l-1;
f[i][j]=INF;
f[i][j]=f[i][j-1]+1;
for(int k=i;k<j;k++)
if(b[k]==b[j])
f[i][j]=min(f[i][j],f[i][k]+f[k+1][j-1]);
}
for(int i=1;i<=len;i++) ans[i]=f[1][i];
for(int i=1;i<=len;i++)
{
if(a[i]==b[i]) ans[i]=ans[i-1];
else
for(int j=1;j<i;j++)
ans[i]=min(ans[i],ans[j]+f[j+1][i]);
}
printf("%d\n",ans[len]);
}
return 0;
}
记忆化搜索写法:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
const int maxn=105;
int f[maxn][maxn],ans[maxn];
char a[maxn],b[maxn];
int dfs(int i,int j)
{
if(i>j) return 0;
if(i==j) return 1;
if(f[i][j]!=-1) return f[i][j];
f[i][j]=dfs(i,j-1)+1;
for(int k=i;k<j;k++)
{
if(b[j]==b[k])
f[i][j]=min(f[i][j],dfs(i,k)+dfs(k+1,j-1));
}
return f[i][j];
}
int main()
{
while(scanf("%s%s",a+1,b+1)!=EOF)
{
memset(f,-1,sizeof(f));
int len=strlen(a+1);
for(int i=1;i<=len;i++) ans[i]=dfs(1,i);
for(int i=1;i<=len;i++)
{
if(a[i]==b[i]) ans[i]=ans[i-1];
else
{
for(int j=1;j<i;j++)
ans[i]=min(ans[i],ans[j]+dfs(j+1,i));
}
}
printf("%d\n",ans[len]);
}
return 0;
}