N个元素入栈，第i+1个元素第j+1个出栈的出栈方案数量

本文链接：https://blog.csdn.net/m0_45118462/article/details/121655615

#include<iostream>
using namespace std;
#define N 5               //N个元素
int mul[2 * N] = { 1 };   //mul[i]:i!
int sel[N][N];            //sel[i][j]:C(i+j,j)-C(i+j,j-1)  C是广义组合数，展开为阶乘形式计算
int arr[N][N];            //arr[i][j]:第i+1个元素第j+1个出栈的出栈方案数量
void f() {
	for (int i = 1; i < 2 * N; i++) {
		mul[i] = i * mul[i - 1];
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			sel[i][j] = mul[i + j] / mul[i] / mul[j] * (i - j + 1) / (i + 1);
		}
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			for (int k = (i + j - N + 1) > 0 ? (i + j - N + 1) : 0; k < i + 1 && k < j + 1; k++) {
				arr[i][j] += sel[i][k] * sel[j - k][j - k] * sel[N - j - 1][N - i - j + k - 1];
			}
		}
	}
}
void print() {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			cout << arr[i][j] << '\t';
		}
		cout << '\n';
	}
}
int main() {
	f();
	print();
	return 0;
}

$O$ ( $N^{2}$ )个计算结果， $O$ ( $N^{3}$ )的时间复杂度