2023江西省赛 D 卡特兰数+dp

题意：https://codeforces.com/gym/104385/problem/D

思路：反向求，找连续pop不超过k的方案数。首先总方案数就是卡特兰数，然后dp部分为dp[i][j]表示进行了i次操作还有j个数在栈中。转移方面就是第i次操作为入还是出，然后出的时候记得减去超过k的部分。

/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
const int mod = 998244353;
int fact[6006];
int infact[6006];
int pow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) {
			res = res * a % mod;
		}
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}
void ini() {
	fact[0] = 1;
	infact[0] = 1;
	for (int i = 1; i <= 6000; i++) {
		fact[i] = fact[i - 1] * i % mod;
		infact[i] = infact[i - 1] * pow(i, mod - 2) % mod;
	}
}
int c(int a, int b) {
	return fact[a] * infact[b] % mod * infact[a - b] % mod;
}
int dp[6005][3005];
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ini();
	int n, k;
	cin >> n >> k;
	int sum = c(2 * n, n) * pow(n + 1, mod - 2) % mod;
	dp[0][0] = 1;
	for (int i = 1; i <= 2 * n; i++) {
		for (int j = 0; j <= i && j <= n; j++) {
			dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j + 1];
			dp[i][j] %= mod;
			if (i >= k + 1 && j + k - 1 <= n) {
				dp[i][j] = dp[i][j] - dp[i - k - 1][j + k - 1] + mod;
			}
			dp[i][j] %= mod;
		}
	}
	cout << (sum - dp[2 * n][0] + mod) % mod << endl;
	return 0;
}