题目链接:https://ac.nowcoder.com/acm/contest/881/E
题解:dp[i][j] 表示,前i个字符,j为A-B的数量的种数,因为可能为负数,所以设个基准1000,当前位置可以是A也可以是B,但要满足A-B大于-m,小于n
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1010;
const ll mod = 1e9 + 7;
int n, m;
ll dp[N * 4][N * 2];
int main() {
while(~scanf("%d %d", &n, &m)) {
dp[0][1000] = 1;
for(int i = 1; i <= 2 * (n + m); i++) {
for(int j = 1000 - m; j <= 1000 + n; j++) {
dp[i][j] = 0;
if(j != 1000 - m)
dp[i][j] = (dp[i][j] + dp[i - 1][j - 1]) % mod;
if(j != 1000 + n)
dp[i][j] = (dp[i][j] + dp[i - 1][j + 1]) % mod;
}
}
printf("%lld\n", dp[2 * (n + m)][1000]);
}
return 0;
}