codeforces 1288 C.Two Arrays

传送门

可将b数组反接在a后面 组成一个长度2 * m的非下降数列

dp[i][j]到长度为i 最大数字到j 的情况数量

dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;

ans = Σdp[m * 2][i]   (i ∈ [1,n]);

ACcode

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>

using namespace std;
typedef long long LL;
const LL mod = 1e9 + 7;

int n,m;
LL dp[25][1005],ans;

int main()
{
	scanf("%d %d",&n,&m);//非下降序列
	m *= 2;
	for(int i = 1;i <= n; i++) dp[1][i] = 1LL;
	for(int i = 2;i <= m; i++){
		for(int j = 1;j <= n; j++){
			dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % mod;
		//	dp[i][j] = (dp[i][j + 1] + dp[i - 1][j]) % mod;
		}
	}
	for(int i = 1;i <= n; i++){//len == m && 最大值<= n  dp[m][i]
		ans = (ans + dp[m][i]) % mod;
	}
	printf("%lld\n",ans);
}