Is there any optimisation for this given recurrence
DP[i][j] = DP[k][j - 1] + sum of arr(i to k - 1);
{0 <= i < n}
{i < k < n}
{0 <= j <= B}
How to optimize this recurrence?
Is there any optimisation for this given recurrence
DP[i][j] = DP[k][j - 1] + sum of arr(i to k - 1);
{0 <= i < n}
{i < k < n}
{0 <= j <= B}
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
tony_sterk | 2020-05-11 20:40:47 | 15 | ||
| en1 |
|
tony_sterk | 2020-05-11 20:17:13 | 206 | Initial revision (published) |