【动态规划】CF9D How many trees?

题意

用n个点组成二叉树，问高度大于等于h的有多少个。

思路

设f[i][j]为i个节点时高度不超过j的二叉树个数，那么
f[i][j]=f[k][j-1]*f[i-k-1][j-1]，即选出一个根节点，两边连高度不超过j-1的子树
求高度大于等于h，即f[n][n]-f[n][h-1]

代码

#include <cstdio>

int n, h;
long long f[36][36];

int main() {
	scanf("%d %d", &n, &h);
	for (int i = 0; i <= n; i++)
		f[0][i] = 1;
	for (int j = 1; j <= n; j++)
		for (int i = 1; i <= n; i++)
			for (int k = 0; k < i; k++)
				f[i][j] += f[k][j - 1] * f[i - k - 1][j - 1];
	printf("%lld", f[n][n] - f[n][h - 1]);
}