UESTC 1425 求任意区间的LIS 线段树区间更新区间查询

最新推荐文章于 2020-05-29 12:47:41 发布

九野的博客

最新推荐文章于 2020-05-29 12:47:41 发布

阅读量2.9k

点赞数

CC 4.0 BY-SA版权

分类专栏：线段树

本文链接：https://blog.youkuaiyun.com/acmmmm/article/details/11976621

本文介绍了如何使用线段树解决求解区间最长连续递增子序列（LCIS）的问题，包括区间更新和区间查询操作。给出了输入输出格式及样例解答。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

九野的博客，转载请注明出处：http://blog.youkuaiyun.com/acmmmm/article/details/11976621

Description

For a sequence S₁,S₂,...,S_N, and a pair of integers (i, j), if 1 <= i <= j <= N and S_i < S_i+1 < S_i+2 <...< S_j-1 < S_j, then the sequence S_i,S_i+1,...,S_j is a CIS (Continuous Increasing Subsequence). The longest CIS of a sequence is called theLCIS (Longest Continuous Increasing Subsequence).

In this problem, we will give you a sequence first, and then some “add” operations and some “query” operations. An add operation adds a value to each member in a specified interval. For a query operation, you should output the length of the LCIS of a specified interval.