poj 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. 

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

---

　　f[j][i]表示从i这里开始，一直往后j个字符的这一段改成回文串最少需要添加的字符。然后第一维可以拉去滚动。转移是显然的。。

Code

/**
 * poj
 * Problem#1159
 * Accepted
 * Time:782ms
 * Memory:748k
 */
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<algorithm>
#ifdef    WIN32
#define    AUTO "%I64d"
#else
#define AUTO "%lld"
#endif
using namespace std;
typedef bool boolean;
#define smin(a, b) (a) = min((a), (b))
#define smax(a, b) (a) = max((a), (b))
template<typename T>
inline void readInteger(T& u){
    char x;
    int aFlag = 1;
    while(!isdigit((x = getchar())) && x != '-');
    if(x == '-'){
        aFlag = -1;
        x = getchar();
    }
    for(u = x - '0'; isdigit((x = getchar())); u = u * 10 + x - '0');
    ungetc(x, stdin);
    u *= aFlag;
}

template<typename T>class Matrix{
    public:
        T *p;
        int lines;
        int rows;
        Matrix():p(NULL){    }
        Matrix(int rows, int lines):lines(lines), rows(rows){
            p = new T[(lines * rows)];
        }
        T* operator [](int pos){
            return (p + pos * lines);
        }
};
#define matset(m, i, s) memset((m).p, (i), (s) * (m).lines * (m).rows)

int n;
char* str;

inline void init() {
    readInteger(n);
    str = new char[(const int)(n + 3)];
    getchar();
    gets(str + 1);
}
#define idx(i)    ((i < 0) ? (i + 3) : (i))

//Matrix<int> f;
int f[3][5005];
inline void solve() {
//    f = Matrix<int>(3, n + 1);
    for(int i = 1; i <= n; i++)
        f[0][i] = 0;
    for(int i = 1; i < n; i++)
        f[1][i] = (str[i] == str[i + 1]) ? (0) : (1);
    int t = 2;
    for(int k = 2; k < n; k++) {
        for(int i = 1; i + k <= n; i++) {
            int j = i + k;
            if(str[i] == str[j])    f[t][i] = f[idx(t - 2)][i + 1];
            else    f[t][i] = min(f[idx(t - 1)][i], f[idx(t - 1)][i + 1]) + 1;
        }
        t = (t == 2) ? (0) : (t + 1);
    }
    printf("%d", f[idx(t - 1)][1]);
}

int main() {
    init();
    solve();
    return 0;
}