求矩阵连乘的最优解代码如下,请选出缺少的语句行: void MatrixChain(int *p,int n,int **m,int **s) { for (int i = 1; i <= n; i++) m[i][i] = 0; for (int r = 2; r <= n; r++) //r表示r个矩阵连乘 for (int i = 1; i <= n - r+1; i++) { int j=i+r-1; m[i][j] = m[i+1][j]+ p[i-1]*p[i]*p[j]; //从i断开 s[i][j] = i; for (int k = i+1; k < j; k++) { int t = if (t < m[i][j]) { m[i][j] = t; s[i][j] = k;} } } }