#Reduce time complexity of a DP algorithm with dictionary and prefixsum method

1 messages · Page 1 of 1 (latest)

manic edge
#

Reduce time complexity of a DP algorithm with dictionary and prefixsum method

barren kettle
#

Can you tell me the original problem?
Can't understand with this code.

barren kettle
#

I see

barren kettle
#

I can't find the solution except code with O(n^3)

#

Is it your University task?

barren kettle
#

Can you share the solution?

sage wind
#

Hello, I can solve this problem with O(n logn) algorithm.