翻译￥￥￥

OpenJudge - 1159:Palindrome

描述

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.

输入

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.

输出

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

描述

回文是一个对称的字符串，即从左到右以及从右到左读取相同的字符串。您需要编写一个程序，给定一个字符串，该程序将确定插入字符串以获得回文的最小字符数。

例如，通过插入2个字符，字符串“Ab3bd”可以转换为回文（“dAb3bAd”或“Adb3bdA”）。但是，插入少于2个字符不会产生回文。

输入

您的程序将从标准输入读取数据。第一行包含一个整数：输入字符串的长度N，3<=N<=5000。第二行包含一个长度为N的字符串。该字符串由大写字母“A”到“Z”、小写字母“A”到“Z”以及数字“0”到“9”组成。大小写字母应被视为不同。

输出

您的程序将写入标准输出。第一行包含一个整数，这是所需的最小数。