/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 vote313 views1 answer
Sony pictures animation films produced
C++
1 vote322 views1 answer
Sfml mouse click
C++
0 vote355 views1 answer
C++ fibo
C++
0 vote295 views1 answer
Count spaces in string java
C++
1 vote293 views1 answer
64 bit unsigned integer c++
C++
2 votes292 views2 answers
Count bits c++
C++
90 votes417 views5 answers
Tostring c++
C++
0 vote329 views1 answer
Argument to number C++
C++
4 votes315 views2 answers
C++ cin operator
C++
0 vote322 views1 answer
Remove decimal c++
C++