【DP生成回文字符串的最小插入字符数】POJ 1159

注意优化空间复杂度，没用滚动数组前49776K，使用后188K——这就是差别！！！

转移方程：

if (str[i] == str[j])
    dp[i][j] = dp[i-1][j-1];
else
    dp[i][j] = 1 + min(dp[i+1][j],dp[i][j-1]);

#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <time.h>
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <cstdlib>
#include <limits.h>
#include <string.h>
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

#define LL long long
#define MIN INT_MIN
#define MAX INT_MAX
#define PI acos(-1.0)
#define FRE freopen("input.txt","r",stdin)
#define FF freopen("output.txt","w",stdout)
#define N 5005
/**********************************************
if (str[i] == str[j])
    dp[i][j] = dp[i-1][j-1];
else
    dp[i][j] = 1 + min(dp[i+1][j],dp[i][j-1]);
**********************************************/
int min(int a,int b){return a > b ? b : a;}
char str[N];
short dp[2][N];//短整型优化空间复杂度
int main () {
    int n;
    while (scanf("%d%s",&n,str+1) != -1) {
        int i,j;
        memset(dp,0,sizeof(dp));
        int k = 0;
        for (i = n ; i >= 1; i--) {
            for (j = i + 1; j <= n; j++) {
                if (i == j) {
                    continue;
                }
                if (str[i] == str[j]) {
                    dp[k][j] = dp[1-k][j-1];
                } else dp[k][j] = 1 + min(dp[1-k][j],dp[k][j-1]);
            }
            for (j = 1; j <= n; j++) dp[1-k][j] = dp[k][j];//滚动数组优化空间复杂度
            k ^= 1;
        }
        printf("%d\n",dp[1-k][n]);
    }
    return 0;
}