/C++/Query for rmq using sqrt decomposition

Query for rmq using sqrt decomposition

int query(int l, int r)
{
  int LB = l/Blk; //Blk = block size
  int RB = r/Blk;
  int minimum = INT_MAX;
  
  if(LB == RB) {
    for(int i=l; i<=r; i++) {
      minimum = min(minimum, arr[i]);
    }
  }
  else {
    for(int i=l; i<Blk*(LB+1); i++) minimum = min(minimum, arr[i]);
    for(int i=LB+1; i<RB; i++) minimum = min(minimum, seg[i]);
    for(int i=RB*Blk; i<=r; i++) minimum = min(minimum, arr[i]);
  }
  return min;
}

Source: youtube.com

Similar codes

12 votes243 views3 answers
How to get input in cpp
C++
0 vote241 views1 answer
Thread group c++
C++
0 vote224 views1 answer
Modulo subtraction
C++
0 vote227 views1 answer
How to fixed how many digit will be after point in c++
C++
0 vote256 views1 answer
String to vector char c++
C++
0 vote309 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++
4 votes246 views1 answer
Arduino uno hello world
C++
0 vote260 views1 answer
C++ restrict template types
C++
0 vote264 views1 answer
Omp multiple reductions
C++
2 votes248 views1 answer
For loop reverse C++
C++