ABBA

链接：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

解析:

需要放n+m个A和B

如果有个长为2(n+m)的串,我们判断是是否合法

从左往右扫,如果有个A,如果n个AB中A不够,先给n个AB中的A

如果大于n,呢么如果比已经分配的BA中的B的数目少,呢么分给BA中的A

B同理,如果不这么分,就会出现多余的A,后面就会少A

ac:

#include<bits/stdc++.h>
#define ll long long
#define MAXN 2005
#define mod 1000000007
using namespace std;
ll dp[MAXN][MAXN];

int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for(int i=0;i<=n+m;i++)
            for(int j=0;j<=n+m;j++)
                dp[i][j]=0;
        dp[0][0]=1;
        for(int i=0;i<=n+m;i++)
        {
            for(int j=0;j<=n+m;j++)
            {
                if(i<n||i-n<min(j,m))//i的个数小于n个AB中的A和已经放了j个BA中的B所需要的A,就直接放
                    dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
                if(j<m||j-m<min(i,n))//j的个数小于m个BA中的B和已经放了i个AB中的A所需要的B,就直接放
                    dp[i][j+1]=(dp[i][j+1]+dp[i][j])%mod;
            }
        }
        printf("%lld\n",dp[n+m][n+m]);
    }
    return 0;
}