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.