/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 vote135 views1 answer
Popualte an array c++
C++
19 votes150 views1 answer
Access last element in vector in c++
C++
14 votes155 views4 answers
C++ define vector with size
C++
0 vote139 views1 answer
C++ sum a vector of digits
C++
0 vote105 views1 answer
SDL_BlitSurface
C++
0 vote174 views1 answer
Google test assert throw
C++
1 vote143 views1 answer
What is difference between single inverted and double inverted in programming languages
C++
2 votes142 views6 answers
Loop in c++
C++
0 vote180 views1 answer
Maximum subarray leetcode c++
C++
0 vote138 views1 answer
Cuda lock
C++