题目链接:点击这里
题目大意:
给出两个数
n
,
m
n,m
n,m ,求满足下列条件的
a
i
,
b
i
a_i,b_i
ai,bi 序列数量:
- 两个序列长度为 m m m
- 两个序列元素取值都在 [ 1 , n ] [1,n] [1,n]
- 对于任意的 i i i 均满足 a i ≥ b i a_i\ge b_i ai≥bi
- a i a_i ai 单调不下降
- b i b_i bi 单调不上升
题目分析:
观察可发现其本质就是构造一个长度为
2
m
2m
2m 的序列且该序列单调不下降
dp:
容易想到二维的状态
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j] 表示第
i
i
i 位值位
j
j
j 的方案数
不难有转移方程:
d
p
[
i
]
[
j
]
=
∑
k
=
1
j
d
p
[
i
−
1
]
[
k
]
dp[i][j]=\sum_{k=1}^jdp[i-1][k]
dp[i][j]=∑k=1jdp[i−1][k] 转移项可通过维护前缀和达到
O
(
n
)
O(n)
O(n) 转移,总体时间复杂度为
O
(
n
m
)
O(nm)
O(nm)
代码如下:
//#pragma GCC optimize(2)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
#define int ll
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int read()
{
int res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 5e3+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
int n,m,dp[maxn][maxn];
signed main()
{
n = read(),m = read();
dp[0][1] = 1;
for(int i = 1;i <= 2*m;i++)
{
int sum = 0;
for(int j = 1;j <= n;j++)
{
sum = (sum+dp[i-1][j])%mod;
dp[i][j] = sum;
}
}
int ans = 0;
for(int i = 1;i <= n;i++) ans = (ans+dp[2*m][i])%mod;
cout<<ans<<endl;
return 0;
}
组合数学:
多重集组合数的组合数模型:从
n
n
n 个数里选出
m
m
m 个可重复的数的方案数是
C
n
+
m
−
1
m
C_{n+m-1}^{m}
Cn+m−1m
所以题目所求就是
C
n
+
2
m
−
1
2
m
m
o
d
1
e
9
+
7
C_{n+2m-1}^{2m} \mod 1e9+7
Cn+2m−12mmod1e9+7 套个Lucas暴力求解组合数即可
代码如下:
//#pragma GCC optimize(2)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
#define int ll
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int read()
{
int res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 5e3+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
int n,m,dp[maxn][maxn];
int qpow(int a,int b)
{
int res = 1;
while(b)
{
if(b&1) res = res*a%mod;
a = a*a%mod;
b >>= 1;
}
return res;
}
int C(int n,int m)
{
if(m > n) return 0;
int up = 1,down = 1;
for(int i = n-m+1;i <= n;i++) up = up*i%mod;
for(int i = 1;i <= m;i++) down = down*i%mod;
return up*qpow(down,mod-2)%mod;
}
int Lucas(int n,int m,int p)
{
if(m == 0) return 1;
return C(n%p,m%p)*Lucas(n/p,m/p,p)%p;
}
signed main()
{
n = read(),m = read();
cout<<Lucas(n+2*m-1,2*m,mod)<<endl;
return 0;
}