Is there any optimisation for this given recurrence↵
↵
↵
~~~~~↵
DP[i][j] = min(DP[k][j - 1] + sum of arr(i to k - 1), DP[i][j]);↵
{0 <= i < n}↵
{i < k < n}↵
{0 <= j <= B}↵
~~~~~↵
↵
↵
↵
↵
↵
↵
↵
~~~~~↵
DP[i][j] = min(DP[k][j - 1] + sum of arr(i to k - 1), DP[i][j]);↵
{0 <= i < n}↵
{i < k < n}↵
{0 <= j <= B}↵
~~~~~↵
↵
↵
↵
↵
↵
