for (int l = 2; l <= n;l ++) { for(int i = 1; i <= n-l+1; i ++) { int j = i+l-1; for (k = i ;k <= j-1; k++ ) { q = m[i][k]+m[k][j]+p[i-1]*p[k]*p[j]; if (q < m[i][j]) { m[i][j] = q; s[i][j] = k; } } } }