An interesting problem

Revision en2, by NNewbie, 2020-02-19 06:47:24

Does someone can help me solve this problem? Click here to the problem 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 $$$

Tags lis

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English NNewbie 2020-02-19 06:47:24 254 Tiny change: 'vance.\n\nProblem means: You are g' -> 'vance.\n\n**Problem means:** You are g'
en1 English NNewbie 2020-02-19 06:38:44 254 Initial revision (published)