Palíndrome
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
The first line contains one integer: the length of the input string ,
. The second line contains one string with length
. 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
The first line contains one integer, which is the desired minimal number.
Input Sample
5
Ab3bdOutput Sample
2
Comments
Si.
¿Con un algoritmo de LCS sale el problema?
Hola . En este problema mando la misma solucion al COJ y me da Accepted y aqui RTE . No se que puede pasar!!! . Saludos .
Recuerda que la memoria límite es 64 MB, una matriz de enteros de 5000 X 5000 se pasa de 64 MB.
Yo hice una DP y declaré el arreglo short, puesto que nunca tienes que añadir más de n letras.