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}
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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) |
Name |
---|