# UVA 10739 String to Palindrome（DP)

In this problem you are asked to convert a string into a palindrome with minimum number of operations. The operations are described below:

Here you’d have the ultimate freedom. You are allowed to:

• Add any character at any position
• Remove any character from any position
• Replace any character at any position with another character

Every operation you do on the string would count for a unit cost. You’d have to keep that as low as possible.

For example, to convert “abccda” you would need at least two operations if we allowed you only to add characters. But when you have the option to replace any character you can do it with only one operation. We hope you’d be able to use this feature to your

#### Output

For each set of input print the test case number first. Then print the minimum number of characters needed to turn the given string into a palindrome.

# Sample Input                               Output for Sample Input

 `6` `tanbirahmed` `shahriarmanzoor` `monirulhasan` `syedmonowarhossain` `sadrulhabibchowdhury` `mohammadsajjadhossain` Case 1: 5 Case 2: 7 Case 3: 6 Case 4: 8 Case 5: 8 Case 6: 8

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
typedef long long LL;
using namespace std;
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define CLEAR( a , x ) memset ( a , x , sizeof a )
const int INF=0x3f3f3f3f;
const int maxn=1100;
int dp[maxn][maxn];
char str[maxn];
int t;
int main()
{
int cas=1;
scanf("%d",&t);
getchar();
while(t–)
{
gets(str+1);
int len=strlen(str+1);
CLEAR(dp,INF);
for(int i=1;i<=len;i++)
{
if(str[i]==str[i+1])
dp[i][i+1]=0;
dp[i][i]=0;
}
for(int l=1;l<=len;l++)
{
for(int i=1;i+l<=len;i++)
{
int j=i+l;
if(str[i]==str[j])
dp[i][j]=min(dp[i][j],dp[i+1][j⑴]);
else
{
dp[i][j]=min(dp[i+1][j],dp[i][j⑴])+1;
dp[i][j]=min(dp[i][j],dp[i+1][j⑴]+1);
}
}
}
printf("Case %d: ",cas++);
printf("%d
",dp[len]);
}
return 0;
}

1. 本站所有资源来源于用户上传和网络，如有侵权请邮件联系站长！
2. 分享目的仅供大家学习和交流，您必须在下载后24小时内删除！
3. 不得使用于非法商业用途，不得违反国家法律。否则后果自负！
4. 本站提供的源码、模板、插件等等其他资源，都不包含技术服务请大家谅解！
5. 如有链接无法下载、失效或广告，请联系管理员处理！
6. 本站资源售价只是赞助，收取费用仅维持本站的日常运营所需！
7. 本站源码并不保证全部能正常使用，仅供有技术基础的人学习研究，请谨慎下载
8. 如遇到加密压缩包，请使用WINRAR解压,如遇到无法解压的请联系管理员！