segment-tree.md

Segment tree

• Alternating groups iii
• Count good triplets in an array
• Count increasing quadruplets
• Count of range sum
• Count of smaller numbers after self
• Count pairs with xor in a range
• Create sorted array through instructions
• Delivering boxes from storage to ports
• Distribute elements into two arrays ii
• Fancy sequence
• Jump game vii
• Longest increasing subsequence ii
• Make array empty
• Maximize subarray sum after removing all occurrences of one element
• Maximum area rectangle with point constraints ii
• Maximum sum of subsequence with non adjacent elements
• Maximum value sum by placing three rooks i
• Maximum value sum by placing three rooks ii
• Minimum number of valid strings to form target ii
• Minimum sum of values by dividing array
• Next greater element iv
• Number of pairs satisfying inequality
• Peaks in array
• Range sum query mutable

Lazy propagation

• Block placement queries
• Count substrings that satisfy k constraint ii
• Handling sum queries after update
• Subarrays distinct element sum of squares i
• Subarrays distinct element sum of squares ii