PKU ACM 1159-Palindrome

题目来源:http://acm.pku.edu.cn/JudgeOnline/problem?id=1159

 

解题报告:

求一个字符串中至少添加几个字符可以使该字符串变成回文串。也是一道简单的DP,我这里用了备忘录的方法,f[i][j]表示要使字符串的第i个到第j个间的字符串成为回文串至少需要添加的字符的个数,那么有两种情况:

第一种,a[i]=a[j],那么f[i][j]=f[i+1][j-1]

第二种,a[i]!=a[j],那么f[i][j]=min(f[i+1][j], f[i][j-1])+1,

对于f[][],我一开始设了一个f[5001][5001],结果报Memory Limit Exceed,于是,我改用动态数组,另外注意到,f[i][j]中j<i的情况是用不到的,因此重新设定,令f[i][j-i]代表原来的f[i][j],那么最后只需要N+(N-1)+...+1=(N+1)*N/2个数,原来则需要N*N个数。再重新提交就AC了。

 

 

附录:

Palindrome
Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 29519 Accepted: 9874

Description

A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal number of characters to be inserted into the string in order to obtain a palindrome.

As an example, by inserting 2 characters, the string "Ab3bd" can be transformed into a palindrome ("dAb3bAd" or "Adb3bdA"). However, inserting fewer than 2 characters does not produce a palindrome.

Input

Your program is to read from standard input. The first line contains one integer: the length of the input string N, 3 <= N <= 5000. The second line contains one string with length N. The string is formed from uppercase letters from 'A' to 'Z', lowercase letters from 'a' to 'z' and digits from '0' to '9'. Uppercase and lowercase letters are to be considered distinct.

Output

Your program is to write to standard output. The first line contains one integer, which is the desired minimal number.

Sample Input

5
Ab3bd

Sample Output

2
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值