超超版主的问题:
如果有n对括号,组成一个式子,而且括号的最深嵌套层次为k
满足这个条件的式子一共有几种?
如果n=3,k=2则有3种:
(())()
()(())
(()())
能否找到递推公式?
------------------------------------------------------------------------------------------
tailzhou 网友的解答:
对于特定的 n,k;
深度为k的子式子最少有k个括号,最多有n个括号
对由i(i >=k and i <=n)个括号组成的深度为k的式子可以由dp数组得到;
其他的n-i个括号分布在深度为k的子式子的前后;
为了不重复统计,规定上面深度为k的子式子是 大式子中的第一个深度为k的子式子;
分别对前面有j(j >=0,j <=n-i,并且这k个括号组成的式子的最大深度不能大于k-1,也就是最大深度从1到k-1的总数的和)个括号,后面有n-i-j(并且这n-i-j个括号组成的式子的最大深度不能大于k)个括号的情况统计;
#include <stdio.h >
#define MAX_N 20
int dp[MAX_N+1][MAX_N+1];
void fun(int n,int k)
{
int i,j;
for (i=k;i <n;++i)
{
int tmp=0;
for (j=0;j <=n-i;++j)
{
int tmp_i=j;
int tmp_j=n-i-j;
int tmp_k1=0,tmp_k2=0;
if (tmp_i >k-1) tmp_i=k-1;
if (tmp_j >k) tmp_j=k;
for (;tmp_i >0 ; tmp_i--)
{
tmp_k1+=dp[j][tmp_i];
}
for (;tmp_j >0 ; tmp_j--)
{
tmp_k2+=dp[n-i-j][tmp_j] ;
}
if (tmp_k1 <1) tmp_k1=1;
if (tmp_k2 <1) tmp_k2=1;
tmp+=tmp_k1*tmp_k2;
}
dp[n][k]+=dp[i-1][k-1]*tmp;
}
dp[n][k]+=dp[n-1][k-1];
}
int main(int argc, char* argv[])
{
//最深嵌套层次为k,那么肯定存在一个层次为k-1的式子,其外围再有一对括号;
//这对括号外再没有嵌套的括号;
int n,k;
for (n=1; n <=MAX_N; n++)
{
dp[n][1]=1;
dp[n][n]=1;
}
for (n=1; n <=MAX_N; n++)
{
for (k=1; k <=n; k++)
{
if (k!=n && k!=1) fun(n,k);
printf("n:%3d k:%3d dp:%10d\n",n,k,dp[n][k]);
}
}
fun(20,2);
printf("input n{max:%d} and k{max:%d}:",MAX_N,MAX_N);
while (scanf("%d %d",&n,&k)==2)
{
printf("%d %d : %d \n" ,n,k,dp[n][k]);
printf("input n{max:%d} and k{max:%d}:",MAX_N,MAX_N);
}
return 0;
}
顺手将其改写成VB代码,如下所示:
Sub fun(ByVal n As Long, ByVal k As Long, ByRef dp())
Dim i As Long, j As Long, temp As Long, temp_i As Long, temp_j As Long, temp_k1 As Long, temp_k2 As Long
For i = k To n - 1
temp = 0
For j = 0 To n - i
temp_i = j
temp_j = n - i - j
temp_k1 = 0
temp_k2 = 0
If temp_i > k - 1 Then temp_i = k - 1
If temp_j > k Then temp_j = k
While temp_i > 0
temp_k1 = temp_k1 + dp(j, temp_i)
temp_i = temp_i - 1
Wend
While temp_j > 0
temp_k2 = temp_k2 + dp(n - i - j, temp_j)
temp_j = temp_j - 1
Wend
If temp_k1 < 1 Then temp_k1 = 1
If temp_k2 < 1 Then temp_k2 = 1
temp = temp + temp_k1 * temp_k2
Next
dp(n, k) = dp(n, k) + dp(i - 1, k - 1) * temp
Next
dp(n, k) = dp(n, k) + dp(n - 1, k - 1)
End Sub
Sub main()
Dim n As Long, k As Long, max_n As Long
max_n = 23
ReDim dp(1 To max_n, 1 To max_n)
For n = 1 To max_n
dp(n, 1) = 1
dp(n, n) = 1
Next
For n = 1 To max_n
For k = 1 To n
If k > 1 And k < n Then fun n, k, dp
Next
Next
[a1].Resize(max_n, max_n) = dp
[a1].Resize(max_n, max_n).Columns.AutoFit
End Sub
在EXCEL中返回:
1 | ||||||||||||||||||||||
1 | 1 | |||||||||||||||||||||
1 | 3 | 1 | ||||||||||||||||||||
1 | 7 | 5 | 1 | |||||||||||||||||||
1 | 15 | 18 | 7 | 1 | ||||||||||||||||||
1 | 31 | 57 | 33 | 9 | 1 | |||||||||||||||||
1 | 63 | 169 | 132 | 52 | 11 | 1 | ||||||||||||||||
1 | 127 | 482 | 484 | 247 | 75 | 13 | 1 | |||||||||||||||
1 | 255 | 1341 | 1684 | 1053 | 410 | 102 | 15 | 1 | ||||||||||||||
1 | 511 | 3669 | 5661 | 4199 | 1975 | 629 | 133 | 17 | 1 | |||||||||||||
1 | 1023 | 9922 |