/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 vote186 views1 answer
New expression
C++
2 votes210 views1 answer
Arduino struct
C++
0 vote197 views1 answer
Phi function
C++
1 vote207 views1 answer
C++ logger class example
C++
1 vote203 views1 answer
Vector search by element
C++
0 vote204 views1 answer
Traverse string in cpp
C++
1 vote214 views1 answer
How to print with the bool value in cpp
C++
1 vote195 views1 answer
Eosio name to string
C++
0 vote192 views3 answers
If
C++
3 votes200 views1 answer
How i say hello world in c++
C++