ZUFE 2475 kiminonamaewa【区间dp】

dp[i][j]=区间回文子序列的个数。

dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1];

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

不断从内往外推，一旦存在str[i]==str[j]那么要加上dp[i+1][j-1]。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
#define ll long long
#define ms(a,b)  memset(a,b,sizeof(a))
const int M=1e3+10;
const int inf=0x3f3f3f3f;
const ll mod =1e9+7;

int i,j,k,n,m;
ll dp[M][M];
char s[M];

int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        scanf("%s",s);
        ms(dp,0);
        for(int i=n-1;i>=0;i--)
        for(int j=i;j<n;j++){
            dp[i][j]=(dp[i+1][j]+dp[i][j-1]-dp[i+1][j-1]+mod)%mod;
            if(s[i]==s[j])dp[i][j]=(dp[i][j]+dp[i+1][j-1]+1)%mod;
        }
        printf("%lld\n",dp[0][n-1]);
    }
    return 0;
}