Various forms of maximum child segments and
The question solution contains a link to the question and question of each question.
Spoj 1043 gss1
Calculate the maximum child segment sum in the static interval,
Question
Spoj 1577 gss2
Like 1, the difference is that if the same element exists in the interval, this element is calculated only once.
Go offline and try again ..
Question
Spoj 1716 gss3
Like 1, it must support single-point modification.
Question
Spoj 2713 gss4
= A common line segment tree, which does not have much to do with this series.
Question
Spoj 2916 gss5
The question is a bit strange. It is similar to 3. It is a little more intense.
Question
Spoj 4487 gss6
Similar to 3. That is, the range can be flipped and moved.
Splay
Question
Spoj 6779 gss7
On the static tree, query the maximum sub-segment of any path and single point modification.
Because the tree structure will not change, you can split the online segment tree.
Question
Spoj GSS series maximum sub-segment and line segment tree + tree link splitting + splay 1043 1557 1716 2713 2916 4487 6779