/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 vote197 views1 answer
All in one c++
C++
1 vote183 views4 answers
Sum vector c++
C++
0 vote179 views1 answer
Call to constructor of 'extClockType' is ambiguous extClockType time2;
C++
0 vote181 views1 answer
One dimensiol array to two dimen c++
C++
0 vote170 views1 answer
Graph using queue c++
C++
0 vote175 views1 answer
How to slice vector in c++
C++
-1 vote158 views1 answer
Assigning a seed on a random number generator in C++
C++
0 vote172 views1 answer
Age in days in c++
C++
0 vote197 views1 answer
Ue4 int to enum c++
C++
0 vote189 views1 answer
Sfml keyboard events cpp
C++