链接
题解
令出栈次数 t = ( m − 1 ) − ( k − 1 ) t=(m-1)-(k-1) t=(m−1)−(k−1)
第一阶段,先从 ( 0 , 0 ) (0,0) (0,0)走到 ( t , m − 1 ) (t,m-1) (t,m−1)
根据卡特兰数的构造方法,方案数为
( m − 1 + t t ) − ( m − 1 + t t + 1 ) \binom{m-1+t}{t} - \binom{m-1+t}{t+1} (tm−1+t)−(t+1m−1+t)
第二个阶段,是要从 ( t , m ) (t,m) (t,m)走到 ( n , n ) (n,n) (n,n)
根据卡特兰数的构造方法,方案数为
( ( n − t ) + ( n − m ) n − t ) − ( ( n − t ) + ( n − m ) n − t + 1 ) \binom{(n-t)+(n-m)}{n-t} - \binom{(n-t)+(n-m)}{n-t+1} (n−t(n−t)+(n−m))−(n−t+1(n−t)+(n−m))
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 2000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
#define mod 1000000007ll
ll fact[maxn], _fact[maxn], a[maxn], inv[maxn];
ll C(ll n, ll m)
{
if(m>n or m<0 or n<0)return 0;
return fact[n]*_fact[m]%mod*_fact[n-m]%mod;
}
int main()
{
ll T=read(), n, m, k, i;
inv[1]=1;
for(int i=2;i<maxn;i++)inv[i]=inv[mod%i]*(mod-mod/i)%mod;
fact[0]=_fact[0]=1;
rep(i,maxn-1)fact[i]=fact[i-1]*i%mod, _fact[i]=_fact[i-1]*inv[i]%mod;
while(T--)
{
n=read(), m=read(), k=read();
ll t=(m-1)-(k-1);
ll ans = ( C(m-1+t,t) - C(m-1+t,m) ) %mod;
( ans *= C((n-t)+(n-m),n-t) - C((n-t)+(n-m),n-t+1) ) %=mod;
printf("%lld\n",(ans+mod)%mod);
}
return 0;
}