/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 vote350 views1 answer
Changing key bindings in visual code not working
C++
0 vote359 views1 answer
Google test assert throw
C++
0 vote350 views1 answer
Shuffle elements c++
C++
0 vote332 views1 answer
What is require to run min max function on linux in cpp
C++
0 vote342 views1 answer
C++ call overriden method from constructor
C++
109 votes557 views6 answers
Int to string c++
C++
1 vote381 views1 answer
Hi cpp
C++
14 votes353 views5 answers
Create a vector of size n in c++
C++
3 votes333 views3 answers
Map in cpp
C++
0 vote381 views1 answer
What is imposter syndrome
C++