HDOJ--1513--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.
输入：
5
Ab3bd
输出：
2
题意：
加最少字符变成回文串
题解：
最长公共子序列变形
字符串正反求最长公共子序列
l - dp[l][l]就可以了
数据范围5000
滚动一下就ok
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 5000 + 5;
char s[maxn],str[maxn];
int dp[2][maxn];
int n;

int main(){
    while(scanf("%d",&n)!=EOF){
        scanf("%s",s);
        int l = strlen(s);
        for(int i = 0; i < l; i ++){
            str[l - i - 1] = s[i];
        }
        memset(dp,0,sizeof(dp));
        for(int i = 0; i < l; i ++){
            for(int j = 0; j < l; j ++){
                if(s[i] == str[j]) dp[(i + 1) % 2][j + 1] = dp[i % 2][j] + 1;
                else dp[(i + 1) % 2][j + 1] = max(dp[i % 2][j + 1],dp[(i + 1) % 2][j]);
            }
        }
        //cout<<dp[l][l]<<endl;
        int ans = l - max(dp[0][l],dp[1][l]);
        printf("%d\n",ans);
    }
    return 0;
}