POJ 1159 Palindrome （LCS）

POJ 1159 Palindrome （LCS）

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

5Ab3bd

Sample Output

2

题意

给出一个字符串，问最少添加几个字符才能构成一个回文串。

思路

对于这种类型的题目是有一个公式的啦！

添加的最少字符个数 = 字符串长度 - （字符串正序与逆序的最长公共子序列长度）

但是，对于这道题，仅仅知道这个公式可不行哦~

题目中有说明字符串长度最大为5000，但是dp数组开到 5000∗5000

有两种解决方案：

使用short类型滚动数组

AC 代码

#include#include#include#include#include#includeusing namespace std;#include#include#include

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。