【原】 POJ 1159 Palindrome 回文 动态规划 解题报告

 

http://poj.org/problem?id=1159

方法1：
c[i][j]表示：s[i...j]子字符串中最少需要插入多少个字符形成回文
c[1][n]为最终结果
初始值：
c[i][i] = 0
c[i][j] = 0，if i>j
递归式：
c[i][j] = c[i+1][j-1]，if s[i]==s[j]
        = min{ c[i+1][j], c[i][j-1] } +1，otherwise

方法2：
len(s)-LCS(s,~s)即为最少插入数，~s为s的逆串
LCS(s,~s)即为原串中可以形成回文的字符的个数，len(s)-LCS(s,~s)为原串中不能形成回文的个数，
因此也是需要插入字符构成回文的最少字符数
可使用滚动数组使得空间需求从O(n*n)降到O(n)

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

 

const int N = 5010 ;

char s[N] ;
int c[N][N]={0} ;
int n ;

//方法1
//递归+记忆化
int DP( int i, int j )
{
    if( i==j )
        return 0 ;
    if( i>j )
        return 0 ;
    if( c[i][j]!=0 )
        return c[i][j] ;

    if( s[i]==s[j] )
        c[i][j] = DP(i+1,j-1) ;
    else
        c[i][j] = std::min( DP(i+1,j), DP(i,j-1) ) +1 ;

    return c[i][j] ;
}

void run1159()
{
    scanf( "%d", &n ) ;
    scanf( "\n%s", s+1 ) ;

    printf( "%d\n", DP(1,n) ) ;
}

//=========================================================

//滚动数组用于DP
int c1[2][N]={0} ;

//方法2
void run1159_2()
{
    int i,j ;
    char s1[N] ;

    scanf( "%d", &n ) ;
    scanf( "\n%s", s+1 ) ;

    for( i=1 ; i<=n ; ++i )
        s1[n+1-i] = s[i] ;

    for( i=1 ; i<=n ; ++i )
    {
        for( j=1 ; j<=n ; ++j )
        {
            if( s[i]==s1[j] )
                c1[i%2][j] = c1[(i-1)%2][j-1]+1 ;  //滚动数组
            else
                c1[i%2][j] = std::max( c1[(i-1)%2][j] , c1[i%2][j-1] ) ;
        }
    }

    printf( "%d", n-c1[n%2][n] ) ;
}