Bigger Than X, in a Slice — Solution & Editorial

Problems > Bigger Than X, in a Slice > Editorial

Bigger Than X, in a Slice — Solution & Editorial

Merge-sort tree: each segment-tree node stores its range SORTED; a query binary-searches in O(log N) nodes for O(log² N) total. Sqrt decomposition with sorted blocks achieves O(√N log) and also passes.

Complexity: O((N + Q√N) log) or O(Q log² N)

Problems > Bigger Than X, in a Slice > Editorial

Bigger Than X, in a Slice — Solution & Editorial

Refer Job