Haruna_K

摘要： Problem Description You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge 阅读全文

摘要： 16.1 16.1 1 ~~~c int c[n+1][n+1]; int b[n+1][n+1]; for (int i = 0; i = f[i] && e[k] c[i][j]) { b[i][j] = k; c[i][j] = res; } } return; } ~~~ 将递归式改为迭代式 阅读全文

摘要： 15.1 15.1 1 证明： ​ T(n) = 1+$\sum_0^{n 1}T(j)$ ​ 令S(n) = $\sum_0^nT(j)$ ​ 则S(n) S(n 1) = 1 + S(n 1) ​ S(n) = $2^{n+1}$ 1 ​ T(n) = $2^n$ 15.1 2 | 长度i | 阅读全文