题意
定义序列中的一个数为前缀最大值仅当其前面没有比他大的数,后缀最大值同理。问有多少个长度为n的排列满足前缀最大值数量恰好为a,后缀最大值数量恰好为b。
分析
稍稍推一下式子就可以发现分治NTT是可以解决滴
代码
#include <bits/stdc++.h>
const int N = 200005;
const int MOD = 998244353;
int n,p,q;
int a[20][N],rev[N];
int L;
int ksm(int x,int y)
{
int ans = 1;
while (y)
{
if (y & 1)
ans = 1ll * ans * x % MOD;
x = 1ll * x * x % MOD;
y >>= 1;
}
return ans;
}
void NTT(int *a,int f)
{
for (int i = 0; i < L; i++)
if (i < rev[i])
std::swap(a[i],a[rev[i]]);
for (int i = 1; i < L; i <<= 1)
{
int wn = ksm(3, f == 1 ? (MOD - 1) / i / 2 : MOD - 1 - (MOD - 1) / i / 2);
for (int j = 0; j < L; j += (i << 1))
{
int w = 1;
for (int k = 0; k < i; k++)
{
int u = a[j + k], v= 1ll * a[j + k + i] * w % MOD;
a[j + k] = (u + v) % MOD;
a[j + k + i] = (u + MOD - v) % MOD;
w = 1ll * w * wn % MOD;
}
}
}
int ny = ksm(L,MOD - 2);
if (f == -1)
for (int i = 0; i < L; i++)
a[i] = 1ll * a[i] * ny % MOD;
}
void solve(int l,int r,int d)
{
if (l == r)
{
a[d][0] = l;
a[d][1] = 1;
return;
}
int mid = (l + r) / 2;
solve(l,mid,d + 1);
for (int i = 0; i <= mid - l + 1; i++)
a[d][i] = a[d + 1][i];
solve(mid + 1,r,d + 1);
int lg = 0;
for (L = 1; L <= r - l + 1; L <<= 1, lg++);
for (int i = 0; i < L; i++)
rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (lg - 1));
for (int i = mid - l + 2; i < L; i++)
a[d][i] = 0;
for (int i = r - mid + 1; i < L; i++)
a[d + 1][i] = 0;
NTT(a[d],1);
NTT(a[d + 1],1);
for (int i = 0; i < L; i++)
a[d][i] = 1ll * a[d][i] * a[d + 1][i] % MOD;
NTT(a[d],-1);
}
int C(int n,int m)
{
int ans = 1, s = 1;
for (int i = 0; i < m; i++)
ans = 1ll * ans * (n - i) % MOD, s = 1ll * s * (i + 1) % MOD;
return 1ll * ans * ksm(s, MOD - 2) % MOD;
}
int main()
{
scanf("%d%d%d",&n,&p,&q);
if (p + q - 2 > n - 1 || !p || !q)
{
puts("0");
return 0;
}
if (n == 1)
{
puts("1");
return 0;
}
solve(0,n - 2,0);
printf("%d", 1ll * a[0][p + q - 2] * C(p + q - 2, p - 1) % MOD);
return 0;
}