/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

5 votes312 views6 answers
For loop in cpp
C++
0 vote293 views1 answer
Remove something from stringstream
C++
0 vote365 views6 answers
Std::string(size_t , char ) constructor:
C++
1 vote356 views1 answer
C++ std::copy to cout
C++
2 votes329 views1 answer
Priority queue in c++
C++
2 votes282 views1 answer
Pointer dereference
C++
17 votes274 views6 answers
C vs c++
C++
36 votes308 views2 answers
Remove at index vector c++
C++
0 vote321 views1 answer
How to type a vertical stack program c++
C++
3 votes397 views2 answers
C++ map insert
C++