LightOJ 1033 - Generating Palindromes 【区间DP】

[code]#include <stdio.h>
#include <ctime>
#include <math.h>
#include <limits.h>
#include <complex>
#include <string>
#include <functional>
#include <iterator>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <bitset>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <iostream>
#include <ctime>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <time.h>
#include <ctype.h>
#include <string.h>
#include <assert.h>

using namespace std;

int t;
char s[1010];
int dp[1010][1010]; 

int main()
{
    scanf("%d",&t);
    for (int ca = 1; ca <= t;ca++)
    {
        memset(dp,0,sizeof(dp));
        scanf("%s",s+1);
        int n = strlen(s+1);

        for (int i = n; i >= 1; i--)
            for (int j = i+1; j <= n; j++)
            {
                if (s[i] == s[j])
                    dp[i][j] = dp[i + 1][j - 1];
                else
                    dp[i][j] = min(dp[i+1][j],dp[i][j-1]) + 1;
            }
        printf("Case %d: %d\n",ca,dp[1]
);
    }
    return 0;
}