/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

1 vote393 views1 answer
Factore of 20 in c+
C++
2 votes333 views1 answer
Unity failed to load window layout
C++
0 vote310 views1 answer
Landscape overleaf
C++
2 votes311 views1 answer
Get type of an object c++
C++
0 vote366 views1 answer
Std::is_standard_layout
C++
2 votes313 views1 answer
Cpp starting code
C++
0 vote354 views1 answer
Inverse lerp c++
C++
2 votes314 views1 answer
Std string to const char * c++
C++
0 vote340 views1 answer
Public method
C++
1 vote313 views2 answers
Bool to string arduino
C++