IOIPALIN - Palindrome 2000

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.


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.


The first line contains one integer, which is the desired minimal number.




hide comments
challenger_76: 2021-03-12 18:15:53

AC with JAVA

saurabh_38: 2021-01-16 22:03:22

Easy problem

raman_111: 2020-04-17 15:58:52

try once aibohphobia spoj dp problem
happy coding ;-)

igzou: 2020-03-10 08:20:53

Top down approach does not get time limit in cpp.

scolar_fuad: 2019-10-23 21:45:16

rought timelimit

adist98: 2019-07-16 05:03:29

It can be solved without LCS.

Last edit: 2019-07-16 21:14:58
exesharkx: 2019-03-26 22:45:16

reverse the String , calculate lcs of both string , print the Dif. length and lcs

foxtrot99: 2019-01-30 09:17:49

No Java solution passed till now :(

foxtrot99: 2019-01-30 09:15:55

Somehow, my most runtime and memory optimized code gets TLE in Java. Any suggestions?

the_root: 2018-12-03 20:40:49

pass in o(n^2)
hhhhhhhh but i have some WA because i forget start dp

Added by:Gareev
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS OBJC PERL6 VB.NET
Resource:IOI 2000, Day 1