/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 vote140 views3 answers
On component begin overlap c++
C++
1 vote143 views1 answer
Ray sphere intersection equation
C++
3 votes151 views8 answers
Yeet
C++
2 votes169 views1 answer
Excel vba delete worksheet if exists
C++
0 vote148 views1 answer
"StepFileGen1." cpp.o failed jetson nano
C++
0 vote155 views1 answer
Ue4 int to enum c++
C++
0 vote135 views1 answer
Intersection.cpp
C++
4 votes137 views2 answers
C++ inline if
C++
0 vote135 views1 answer
Random key generator c++ all unique characters
C++
2 votes152 views2 answers
How to check a number in string
C++