摘要：
题意：Given n integers. You have two operations: U A B: replace the Ath number by B. (index counting from 0) Q A B: output the length of the longest consecutive increasing subsequence (LCIS) in [a, b].分析：区间合并类线段树。 las[maxn<<2] 区间左端起最长的序列长度 ras[maxn<<2] 区间右端起最长的序列长度mov[maxn<<2]区间最优值#in 阅读全文
