Maximum sum subarray problem revisited

Revision en2, by tom, 2017-03-29 00:57:48

Hello everyone,

I would like to quickly compute maximum sum subarray with queries (change ith element to x). Can we do it faster than O(log(n)) per query?


  Rev. Lang. By When Δ Comment
en2 English tom 2017-03-29 00:57:48 7 Tiny change: 'r than $O(sqrt(n))$ per ' -> 'r than $O(log(n))$ per '
en1 English tom 2017-03-29 00:53:47 203 Initial revision (published)