Incorrect updating in Segment Tree?

[bandgeekdante]

cpbook-code/ch2/ourown/segmenttree_ds.cpp

Line 64 in fa53432

st[p] = (lsubtree <= rsubtree) ? st[l(p)] : st[r(p)];

I think that this line should just use conquer(lsubtree,rsubtree), as currently it doesn't use the lazy value if applicable, and only checks for the minimum rather than what the conquer function specifies

[bandgeekdante]

Actually I think you can replace lines 62-64 with simply conquer(l(p), r(p)) since the code has already called update on both l(p) and r(p), and update always begins with propagate which ensures that the two children won't have lazy flags set.