added range update code

[A-stick-bug]

Added sqrt decomposition code that supports both range updates and range queries in O(sqrt(n))

[github-actions]

Visit the preview URL for this PR (for commit 603e7ea):

https://cp-algorithms--preview-1204-f0s8g2k4.web.app

(expires 2023-12-27T02:26:54.469890884Z)

[adamant-pwn]

Thanks for the pull request! I have few concerns here:

1. At the moment the implementation is just dumped in the middle of the paragraph without any further explanation. The paragraph itself uses names $b$ and $c$ for arrays, which is obviously inconsistent with the names used in the code, and should be fixed to provide a better continuity.
2. I'm not sure whether Python implementation is particularly useful. Was it tried on specific problems? How does it fare against C++ implementations? Sqrt decomposition often has a large constant time factor, and with Python it might be even worse...

[adamant-pwn]

@A-stick-bug hi, do you plan any further work on this pull request?

[A-stick-bug]

I will write it in c++ some time this weekend and make it consistent with the rest of the code. Also, I tested it on this question: DMOPC '15 Contest 1 P6 - Lelei and Contest - DMOJ: Modern Online Judge <https://dmoj.ca/problem/dmopc15c1p6>

…

On Thu, Jan 4, 2024 at 8:40 AM Oleksandr Kulkov ***@***.***> wrote: @A-stick-bug <https://github.com/A-stick-bug> hi, do you plan any further work on this pull request? — Reply to this email directly, view it on GitHub <#1204 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AY7C6JUX4EPINTAGTPL4KH3YM2WLBAVCNFSM6AAAAABAL2LUKKVHI2DSMVQWIX3LMV43OSLTON2WKQ3PNVWWK3TUHMYTQNZXGEYTCNBTG4> . You are receiving this because you were mentioned.Message ID: ***@***.***>