去掉根节点,只看左右两边。设一共有i个节点,左边有j个节点,则右边有i-j-1个节点。设a[i]为方案数,则左边有a[j]种,右边有a[i-j-1]种,根据乘法原则,总数a[i]=a[j]*a[i-j-1]
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<climits>
#define MAXA 55
using namespace std;
long long a[MAXA] = {1};
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=0;j<=i;j++)
a[i] += a[j] * a[i-j-1];
printf("%lld",a[n]);
}