/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

66 votes134 views8 answers
Dogecoin price
C++
0 vote94 views1 answer
C++ hsl to rgb integer
C++
0 vote99 views1 answer
Resize method in c++ for arrays
C++
-1 vote137 views5 answers
Memset in c++
C++
3 votes61 views1 answer
2 dimensional array c++ loop
C++
8 votes110 views6 answers
C++ while loop
C++
8 votes93 views5 answers
C++ vector resize
C++
0 vote197 views1 answer
C++ basic snippet
C++
2 votes109 views1 answer
C++ compare strings ignore case
C++
0 vote106 views1 answer
Assoc-right antlr
C++