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

九野的博客，转载请注明出处：http://blog.csdn.net/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.

Input

The first line of the input is an integer T, which stands for the number of test cases you need to solve.

Every test case begins with two integers N, Q, where N is the size of the