/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

0 vote198 views1 answer
How to increase array memory in c++
C++
19 votes277 views6 answers
Initialize 2D vector
C++
0 vote201 views1 answer
C++ sudoku solver
C++
0 vote209 views1 answer
How to calculate bitwise xor c++
C++
5 votes203 views1 answer
How to find 2d vector length cpp
C++
0 vote189 views1 answer
Javascript if else exercises
C++
1 vote196 views1 answer
Parallelize for loop c++
C++
0 vote198 views1 answer
Spicoli
C++
0 vote222 views1 answer
Opencv rgb to gray c++
C++
4 votes192 views1 answer
Appending a double to a string c++
C++