Practice · 4 of 4
Max Subarray Under Assign
CHALLENGE
Difficulty: advanced+25 XP
**Bài toán.** 1 l r v assigns v to [l, r]; 2 l r prints the maximum
non-empty subarray sum inside [l, r].
**Constraints:** 1 ≤ n, q ≤ 2·10^5; |v|, |a[i]| ≤ 10^9.
Press Submit to check your solution.
Back to lesson: Practice: Lazy Tree Drills