线段树
文章平均质量分 81
小纪萱苏
这个作者很懒,什么都没留下…
展开
-
hdu 3308 LCIS
Description 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 (LC原创 2016-01-21 20:18:54 · 272 阅读 · 0 评论 -
hdu 3397 Sequence operation(线段树区间覆盖,区间合并)
Problem Description lxhgww 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 · 334 阅读 · 0 评论 -
hdu 5726 GCD(线段树+预处理)
Problem Description Give you a sequence of N(N≤100,000) integers : a1,...,an(0 Input The 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 · 312 阅读 · 0 评论