- Hello
- Suppose we heve a balck box that can get a tree and each time we give it two vertex (for example u , v)it gives — us lowest common ancestor (LCA) of u and v.
- Now you have an array A of size N and gives you M queri , each query have two integer L , R that want you to
- find minimum integer from L to R in A ,
- use black box to answer each query.
- please write your solution in comment :))
