Doubt in lazy tree time complexity !

Revision en1, by atlasworld, 2019-01-26 07:32:24

Suppose we have an array of n = 10^5 elements . 1 index based.

now , we build a segment tree with lazy propogation .

there are large queries , in each query you have to update elements in the range from 1 to n every time . by +x.

will the time complexity be O(n*m*logn) ? ? since everytime our numbers are from minn index to maxxindex.


  Rev. Lang. By When Δ Comment
en1 English atlasworld 2019-01-26 07:32:24 387 Initial revision (published)