Preview
Link Preview
Codeforces
Need help in optimizing solution to a dynamic programming problem
Hello friends, I was trying to solve this dynamic programming problem. The editorial proposes an $$$\mathcal{O}(N^4)$$$ solution to this problem, but I think it could be solved in $$$\mathcal{O}(N^3)$$$ time according to the following approach:
Hello friends, I was trying to solve this dynamic programming problem. The editorial proposes an $$$\mathcal{O}(N^4)$$$ solution to this problem, but I think it could be solved in $$$\mathcal{O}(N^3)$$$ time according to the following approach:
Issue #7
Instant view isn't able to load latex
- Type of issue
- Submitted via the Previews bot
- Reported
- Jun 21, 2021