/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 vote130 views1 answer
What type is this c++
C++
0 vote134 views1 answer
Cmake g++ address sanitizer
C++
0 vote140 views1 answer
How to display score using SDL in c++
C++
0 vote130 views1 answer
Std::map get all keys
C++
0 vote141 views2 answers
If else in C++
C++
0 vote144 views1 answer
Create vector of specific size c++
C++
0 vote134 views2 answers
How to compile with libstdc++ fedora
C++
1 vote148 views1 answer
Cout console
C++
1 vote162 views1 answer
Plus (programming language)
C++
0 vote146 views1 answer
Push_back a pair c++
C++