Does someone can help me solve this problem? [Click here to the problem](https://acm.sjtu.edu.cn/OnlineJudge/problem/4239)↵
It's a problem about `Lis` , I think this problem is interesting , but I cannot solve it. Thanks in advance.↵
↵
**Problem means:** You are given an array $p$ of length $n$ , each $p_i$ is in the range of $[L_i,R_i]$ . What is the length of the longest increasing subsequence of this array?↵
$1 \leq n \leq 3 \times 10^5, 1 \leq L_i \leq R_i \leq 2 \times 10^9 $
It's a problem about `Lis` , I think this problem is interesting , but I cannot solve it. Thanks in advance.↵
↵
**Problem means:** You are given an array $p$ of length $n$ , each $p_i$ is in the range of $[L_i,R_i]$ . What is the length of the longest increasing subsequence of this array?↵
$1 \leq n \leq 3 \times 10^5, 1 \leq L_i \leq R_i \leq 2 \times 10^9 $
