Help with a data structure problem

Revision en1, by MOOONI, 2024-08-19 09:40:11

There is a vector of intervals (called v) that is initially empty. There are Q queries to process. two types of queries might appear:

  1. add an interval (x, y) to an arbitrary place in v. (1 <= x <= y <= 10 ^ 5)

  2. What is the last interval among the first t elements in v, that contains the number x. (1 <= t <= 10 ^ 9)

the number of queries is at most 10 ^ 5

Tags data structures

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English MOOONI 2024-08-19 09:43:26 0 (published)
en2 English MOOONI 2024-08-19 09:41:57 29
en1 English MOOONI 2024-08-19 09:40:11 403 Initial revision (saved to drafts)