![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
小纪萱苏
这个作者很懒,什么都没留下…
展开
-
hdu 3308 LCIS
DescriptionGiven 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 (LC原创 2016-01-21 20:18:54 · 266 阅读 · 0 评论 -
hdu 3397 Sequence operation(线段树区间覆盖,区间合并)
Problem Descriptionlxhgww got a sequence contains n characters which are all '0's or '1's.We have five operations here:Change operations:0 a b change all characters into '0's in [a , b]1 a原创 2016-05-28 16:10:45 · 326 阅读 · 0 评论 -
hdu 5726 GCD(线段树+预处理)
Problem DescriptionGive you a sequence of N(N≤100,000) integers : a1,...,an(0 InputThe first line of input contains a number T, which stands for the number of test cases you need to solve.原创 2016-07-24 20:20:53 · 302 阅读 · 0 评论