2019牛客暑期多校训练营（第一场）E 题ABBA [dp]

链接：https://ac.nowcoder.com/acm/contest/881/E
来源：牛客网

ABBA
时间限制：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)
输入描述:
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≤103

• There are at most 2019 test cases, and at most 20 of them has max{n,m}>50
  输出描述:
  For each test case, print an integer which denotes the result.
  示例1
  输入
  复制
  1 2
  1000 1000
  0 0
  输出
  复制
  13
  436240410
  1
  题意：有一个长为2(n+m)的只含有字符A和字符B的字符串s，已知s可以拆分成一个长为2n的AB串和一个长为2m的BA串，求原串可能的种类数%(1e9+7)
  题解：dp[i][j]表示含有i个字符A和j个字符B的合法种类数，那么只要保证转移过程一直合法即可，而合法的条件是s可以拆分成一个长为2n的AB串和一个长为2m的BA串，所以在这个i+j的字符串中A的个数-B的个数应<=n，因为>n时肯定会有多于2n的AB串，同时B的个数-A的个数<=m，限制合法条件之后直接使用dp[i][j]=dp[i-1][j]+dp[i][j-1]转移即可

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll dp[2005][2005];
int main(){
    int n,m;
    while(scanf("%d%d",&n,&m)==2){
        int id=0;
        dp[0][0]=1;
        for(int i=0;i<=n+m;i++){
            for(int j=0;j<=n+m;j++){
                if(i!=0||j!=0)dp[i][j]=0;
                if(i-j>n||j-i>m)continue;
                if(i>=1){
                    dp[i][j]=dp[i-1][j];
                    dp[i][j]%=mod;
                    if(j>=1){
                        dp[i][j]=(dp[i][j]+dp[i][j-1])%mod;
                        dp[i][j]%=mod;
                    }
                }
                else if(j>=1){
                    dp[i][j]=dp[i][j-1];
                    dp[i][j]%=mod;
                }
            }
        }
        printf("%lld\n",dp[n+m][n+m]);
    }
    return 0;
}