链接:https://ac.nowcoder.com/acm/contest/881/E
来源:牛客网
时间限制:C/C++ 2秒,其他语言4秒
空间限制:C/C++ 524288K,其他语言1048576K
64bit IO Format: %lld
题目描述
Bobo has a string of length 2(n + m) which consists of characters `A` and `B`. The string also has a fascinating property: it can be decomposed into (n + m) subsequences of length 2, and among the (n + m) subsequences n of them are `AB` while other m of them are `BA`.
Given n and m, find the number of possible strings modulo (109+7)(109+7).
输入描述:
The input consists of several test cases and is terminated by end-of-file. Each test case contains two integers n and m. * 0≤n,m≤1030≤n,m≤103 * There are at most 2019 test cases, and at most 20 of them has max{n,m}>50max{n,m}>50.
输出描述:
For each test case, print an integer which denotes the result.
示例1
输入
复制
1 2 1000 1000 0 0
输出
复制
13 436240410 1
dp,由于要生成n个AB,m个BA,所以AB的A肯定是先用的前面的A,剩下的A去组成BA,然后可以发现如果
我们用dp[x][y],其中x为前缀有x个A,y为前缀有y个B,则可以通过之后添加A,或添加B,判断是否会出现前缀里的x-y>n如果
出现,则为不合法,因为这样会出现大于n的AB,BA也同理
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3+9;
typedef long long ll;
const ll mod = 1e9+7;
ll dp[maxn][maxn];
void add(ll &a,ll b){
a+=b;
if(a>=mod)a-=mod;
}
int main(){
int n,m;
while(~scanf("%d%d",&n,&m)){
for(int i=0;i<=n+m;i++){
if(i<=m)dp[0][i]=1;
else dp[0][i]=0;
}
for(int i=1;i<=n+m;i++){
for(int j=0;j<=n+m;j++){
dp[i][j]=0;
if(i-j<=n){
add(dp[i][j],dp[i-1][j]);
}
if(j-i<=m){
add(dp[i][j],dp[i][j-1]);
}
}
}
printf("%lld\n",dp[n+m][n+m]);
}
return 0;
}