We will binary search the answer, using the segment tree. Each node of the segment tree will tell us whether all values in the node's segment can be seen in the query interval. The condition is that $segmentTree[node]$ to be greater than or equal to the left end of the query. Using this condition, we can binary search the answer while moving along the segment tree in $O(logN)$.

The final time complexity of the solution is $O((N + Q) * logN)$.

The final time complexity of the solution is $O((N + Q) * logN)$.
 
h3. -Request- Notice
 
-Contacteaza-l pe autor daca te oferi sa traduci enuntul in limba romana.- Multumim lui ==user(user="Matteoalexandru" type="tiny")== pentru 'traducere':verkhoyansk/solutie_romana