ABBA

最新推荐文章于 2019-08-16 19:48:32 发布

newhonor

最新推荐文章于 2019-08-16 19:48:32 发布

阅读量154

点赞数

分类专栏： dp 思维

本文链接：https://blog.csdn.net/weixin_39132605/article/details/98218881

版权

思维同时被 2 个专栏收录

94 篇文章 0 订阅

订阅专栏

56 篇文章 0 订阅

订阅专栏

https://ac.nowcoder.com/acm/contest/881/E

思路：dp[i][j]表示：i个A，j个B；放A前必须有n个B与前面的A匹配，不然AB会变多，不符合；同理B一样；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)


//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;


//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e5+9;
const int maxm=4e5+9;
const int mod=1e9+7;


ll dp[2009][2009];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n,m;
    while(cin>>n>>m)
    {
        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>0&&i-j<=n) dp[i][j]=(dp[i-1][j]+dp[i][j])%mod;
                if(j>0&&j-i<=m) dp[i][j]=(dp[i][j-1]+dp[i][j])%mod;
            }
        }
        cout<<dp[n+m][n+m]<<endl;
    }


    return 0;
}