ZJCOJ qwb与二叉树 dp or 记忆化搜索

题目链接

思路:

dp[i][j]表示i个节点j个叶子的节点数为多少,

dp[n][m]=∑i∑jdp[i][j]∗dp[n−1−i][m−j]

#include<bits/stdc++.h>
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define exp 0.00000001
#define  pii  pair<int, int>
#define  mp   make_pair
#define  pb   push_back
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
ll dp[55][55]; 
ll dfs(int x,int y)
{
	if(dp[x][y]!=-1)
	return dp[x][y];
	int ans=0;
	for(int i=0;i<x;i++)
	{
		for(int j=0;j<=i&&j<=y;j++)
		{
			ans=(ans+dfs(i,j)*dfs(x-i-1,y-j)%MOD)%MOD;
		}
	}
	return dp[x][y]=ans; 
}
int main()
{
	CLR(dp,-1);
	dp[0][0]=1;
	dp[1][0]=0;
	dp[0][1]=0;
	dp[1][1]=1;
	ll n,m;
	while(~Rl(n))
	{
		Rl(m);
		Pl(dfs(n,m));
	}
 return 0;
}