【JZOJ5316】【清华集训2017模拟8.19】merge

Description

Data Constraint

Solution

我们考虑最简单的dp，我们设dp[i][j]表示p到i，q到j的不同方案。那么转移也显然dp[i][j]=dp[i-1][j]+dp[i][j-1]。但这样会算重。所以我们考虑在什么情况下计算会重复。我们发现当p的i-k~i,与q的j-k~j相等时，我们就会算重，因此我们要保证p的标点时刻在j前方，这就成了括号序，又因为我们要保证要恰好在i,j括号序才结束，所以我们预先在起点放一个左括号，终点放右括号，那么方案即卡特兰数$C_{2*(k-1)}^{k-1}\over k$
时间复杂度O(N^2).

Code

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
const ll maxn=4e3+5,mo=1e9+7;
ll a[maxn],b[maxn],f[maxn][maxn],g[maxn][maxn],c1[maxn],d[maxn];
ll n,i,t,j,k,l,x,y,z,num;
ll mi(ll x,ll y){
    if (y==1) return x;
    ll t=mi(x,y/2);
    if (y%2)return t*t%mo*x%mo;return t*t%mo;
}
ll make(ll x,ll y){
    return c1[x]*mi(c1[y],mo-2)%mo*mi(c1[y],mo-2)%mo*mi(y+1,mo-2)%mo;
}
int main(){
    freopen("merge.in","r",stdin);freopen("merge.out","w",stdout);
    scanf("%lld",&n);
    for (i=1;i<=n;i++)scanf("%d",&a[i]);
    for (i=1;i<=n;i++)scanf("%d",&b[i]);c1[0]=1;
    for (i=1;i<=2*n;i++)c1[i]=c1[i-1]*i%mo;
    for (i=1;i<=n;i++)d[i]=make(2*i,i);d[0]=1;
    f[0][0]=1;
    for (i=0;i<=n;i++)
        for (j=0;j<=n;j++){
            if (!i && !j) continue;
            f[i][j]=((i>0)*f[i-1][j]+(j>0)*f[i][j-1])%mo;
            if (a[i]==b[j]){
                g[i][j]=g[i-1][j-1]+1;t=g[i][j];
                for (k=1;k<=t;k++)
                    f[i][j]=(f[i][j]-f[i-k][j-k]*d[k-1]%mo+mo)%mo;
            }
        }
    printf("%lld\n",f[n][n]);
}