hdu1513 dp

Problem 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
题意：给出一个字符串，问最少再添加多少个字符使得字符串构成一个回文串
思路：做这个题目的时候突然想到了括号的最大匹配问题（胡思乱想）！我们只要求一下该串与其反串的最长公共子序列就可以了嘛，我们需要用一下滚动数组，因为直接开的花5005*5005超了
ac代码：
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
char a[100005];
int dp[3][50005];
int main()
{
    int n;
    while(cin>>n)
    {
        scanf("%s",a);
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
               if(a[i-1]==a[n-j])
               {
                 dp[i%3][n-j]=dp[(i-1)%3][n-j+1]+1;
               }
               else
               {
                  dp[i%3][n-j]=max(dp[(i-1)%3][n-j],dp[i%3][n-j+1]);
               }
            }
        }
        cout<<n-dp[n%3][0]<<endl;
    }
    return 0;
}