10.24 2020ICPC·小米 网络选拔赛热身赛 A
题意:
询问子序列有n个AB,m个BA,问这样的序列有多少种?
解题思路:(我队友写的,我加些自己的理解)
AC代码:
#include <bits/stdc++.h>
#define endl '\n'
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define FILE freopen(".//data_generator//in.txt","r",stdin),freopen("res.txt","w",stdout)
#define FI freopen(".//data_generator//in.txt","r",stdin)
#define FO freopen("res.txt","w",stdout)
#define mp make_pair
#define seteps(N) fixed << setprecision(N)
typedef long long ll;
using namespace std;
/*-----------------------------------------------------------------*/
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
#define INF 0x3f3f3f3f
const int N = 5e3 + 10;
const double eps = 1e-5;
const int M = 1e9 + 7;
ll dp[N][N];
ll solve(int n, int m) {
int nm = n + m;
int len = 2 * (n + m);
dp[0][0] = 1;
//dp[i][j]代表前i个位置,有j个A
for(int p = 1; p <= len; p++) {
for(int ctn = 0; ctn <= min(p, nm); ctn++) {
dp[p][ctn] = 0;
//B
if(nm - ctn >= m - (p - ctn) + 1) {
//当前能选B的情况:剩余A的个数 >= BA所需A的个数,(p - ctn)代表选到第p-ctn个B,则后面至少需要m-(p-ctn)+1个B
dp[p][ctn] += dp[p - 1][ctn];
}
//A
if(nm - (p - ctn) >= n - ctn + 1) {
//当前选A的情况:剩余B的个数 >= AB所需B的个数,ctn代表选到第ctn个A
if(ctn > 0) dp[p][ctn] += dp[p - 1][ctn - 1];
}
dp[p][ctn] %= M;
}
}
return dp[len][n + m];
}
int main() {
IOS;
int n, m;
while(cin >> n >> m) {
cout << solve(n, m) << endl;
}
}