HDU4632 区间DP

题意：问串里有多少个回文子序列。

题解：区间DP，容斥思想。（和Codeforces245H类似）

#include <bits/stdc++.h>

using namespace std;
using ll = long long ;
using ld = long double;

#define pb push_back
#define SZ(X) ((int)X.size())
#define mp make_pair
#define Fi first
#define Se second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define ALL(X) X.begin(),X.end()
#define RALL(X) X.rbegin(),X.rend()
#define rep(i,j,k) for(int i = j;i <= k;i ++)
#define per(i,j,k) for(int i = j;i >= k;i --)
#define mem(a,p) memset(a,p,sizeof(a))


ll qmod(ll a,ll b,ll c) {ll res=1;a%=c; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%c;a=a*a%c;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<typename T, typename S>
void upmax(T& a,S b){if(a<b) a=b;}
template<typename T, typename S>
void upmin(T& a,S b){if(a>b) a=b;}


*****************************************************************************************************
/
/
*****************************************************************************************************

const int N = 1024, MOD = 10007;
int dp[N][N];
char s[N];


int main()
{
    int T;  scanf("%d", &T);
    int _ = 0;
    while(T --) {
        memset(dp, 0, sizeof(dp));
        scanf("%s", s + 1);
        int n = strlen(s + 1);

        dp[n][n] = 1;

        per (i, n - 1, 1) {
            dp[i][i] = 1;
            rep (j, i + 1, n) {
                dp[i][j] = dp[i + 1][j] + dp[i][j - 1] - dp[i + 1][j - 1];
                if(s[i] == s[j]) dp[i][j] += dp[i + 1][j - 1] + 1;
                while(dp[i][j] >= MOD) dp[i][j] -= MOD;
                while(dp[i][j] < 0) dp[i][j] += MOD;
            }
        }

        printf("Case %d: %d\n",++_, dp[1][n]);
    }
    return 0;
}