Codeforces 245H 区间DP容斥

题意：给出一个字符串S(|S| <= 5000), Q个询问(1E6)， 每次给出L,R， 问L,R里有多少个回文子串。

题目链接：http://codeforces.com/contest/245/problem/H

题解：dp[i][j] = dp[i + 1][j] + dp[i][j - 1] - dp[i + 1][j - 1] + can[i][j]. 注意下dp顺序即可。

           其中can数组 can[i][j] = can[i + 1][j - 1] & (s[i] == s[j])

代码：

#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))


const ll MOD = 1E9 + 7;
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%MOD;}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 = 5010;

int dp[N][N];
bool can[N][N];
char s[N];
int n;

int main()
{
    scanf("%s", s + 1);
    n = strlen(s + 1);

    rep (i,1,n-1) {
        can[i][i] = 1;
        if(s[i] == s[i + 1]) can[i][i + 1] = 1;
    }

    per (i,n - 2,1) {
        rep (j,i + 2,n) {
            can[i][j] = can[i+1][j-1] & (s[i] == s[j]);
        }
    }

    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] + can[i][j];
        }
    }

    int q;  scanf("%d", &q);

    while(q --) {
        int L,R;
        scanf("%d %d", &L, &R);
        printf("%d\n",dp[L][R]);
    }

    return 0;
}