HDU 4632 Palindrome subsequence (区间DP)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4632

 

题意：求一段字符串的回文子序列

 

思路：dp[j][i]表示这个区间内的回文子序列个数，然后再向两端扩展

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <utility>
#include <functional>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;

const int inf = 0x3f3f3f3f;
const int mod = 10007;

char ch[1010];
int dp[1010][1010];

int main()
{
    int  t;
    cin >> t;
    int ca = 1;
    while (t--)
    {
        scanf("%s", ch);
        int n = strlen(ch);
        for (int i = 0; i < n; i++)
        {
            dp[i][i] = 1;
            if (i == n - 1) continue;
            if (ch[i] == ch[i + 1])
            {
                dp[i][i + 1] = 3;
            }
            else
            {
                dp[i][i + 1] = 2;
            }
        }
        for (int i = 0; i < n; i++)
        {
            for (int j = i - 2; j >= 0; j--)
            {
                dp[j][i] = dp[j][i - 1] + dp[j + 1][i] - dp[j + 1][i - 1];
                if (ch[i] == ch[j])
                {
                    dp[j][i] += dp[j + 1][i - 1] + 1;
                }
                while (dp[j][i] < 0)
                    dp[j][i] += mod;
                dp[j][i] %= mod;
            }
        }
        printf("Case %d: %d\n", ca++, dp[0][n - 1]);
    }
    return 0;
}