给定一个长度为 $N$ 的序列 $A_1, A_2, \ldots, A_N$。序列中的每个元素都是 $1$ 到 $N$ 之间互不相同的整数。请编写一个程序执行以下查询：
l r：输出 $(A_l, A_{l+1}, \ldots, A_r)$ 的最长递增子序列（LIS）的长度。第一行包含序列的长度 $N$ 和查询的数量 $Q$。
接下来 $Q$ 行，每行给出一个如上所述的查询。
对每个查询，输出一行答案。
9 10 6 9 4 2 1 5 7 8 3 1 9 2 8 3 7 4 6 5 5 1 5 2 6 3 7 4 8 5 9
4 4 3 2 1 2 2 3 4 4
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: