利用伸展树完成对数列的维护 包括插入删除翻转求最大子序列和 任意位置后n个位置和等功能-Stretch tree complete after a series of maintenance, including to insert delete Flip seeking the largest sub-sequences and anywhere n positions and other functions