去学了几天高级数据结构和算法,莫队,fhq Treap,线段树啥的,也不知道有没有用
倒数第二个测试点超时了。33分
// Red-black Tree
#include <iostream>
using namespace std;
const int maxn = 505;
const int con = 1000000007;
typedef long long ll;
ll red[maxn][maxn];
ll black[maxn][maxn];
// red[i][j]->含i个节点,以红色节点为根的树,子树黑高度为j时可能的个数
// ans = sum(black[n][k])
int main(){
int n;
scanf("%d",&n);
red[0][0] = 1;
red[1][0] = 1;
black[1][0] = 0,black[1][1] = 1;
for(int i = 2;i <= n;i++){
for(int j = 1;j <= n;j++){
// 含i个节点,子树黑高度为j
// 两个子树一共含i - 1个节点,黑高度为j
for(int k = 0;k <= i - 1;k++){ // 左子树k个节点,右子树i - 1 - k个节点
red[i][j] += black[k][j] * black[i - 1 - k][j];
red[i][j] = red[i][j] % con;
black[i][j] += (red[k][j - 1] + black[k][j - 1]) * (red[i - 1 - k][j - 1] + black[i - 1 - k][j - 1]);
black[i][j] = black[i][j] % con;
}
}
}
ll ans = 0;
for(int i = 0;i <= n;i++){
ans += black[n][i];
ans = ans % con;
}
printf("%lld",ans);
system("pause");
return 0;
}