hejiahaolib
v1.0.2
Published
$$dp[i][j] = \begin{cases} 0 & j = 0 \\ \min\{dp[i][k] + dp[(i+k+1)\%n][j-k-1] + sum(i,j)\} & 0\leq k < j \end{cases}$$
Downloads
7
Readme
$$dp[i][j] = \begin{cases} 0 & j = 0 \ \min{dp[i][k] + dp[(i+k+1)%n][j-k-1] + sum(i,j)} & 0\leq k < j \end{cases}$$