/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

3 votes105 views1 answer
Reference function in c++
C++
4 votes92 views3 answers
Count set bits in an integer c++
C++
0 vote134 views1 answer
Short int range in c++
C++
0 vote100 views1 answer
MPI_File_seek
C++
0 vote110 views1 answer
Ue4 int to enum c++
C++
1 vote58 views1 answer
Add element to start of vector c++
C++
0 vote95 views1 answer
Size of set c++
C++
-1 vote102 views1 answer
What does for do in c++
C++
0 vote103 views1 answer
How to point to next array using pointer c++
C++
0 vote95 views1 answer
Abstraction in cpp
C++