/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

-2 votes102 views1 answer
2d array
C++
0 vote157 views1 answer
Find first of a grammar
C++
0 vote140 views1 answer
How to loop through a set of pairs in c++
C++
0 vote153 views1 answer
Print stack without pop c++
C++
0 vote141 views1 answer
How to have a queue as a parameter in c++
C++
0 vote134 views2 answers
Easy way to encrypt a c++ file line by line
C++
0 vote135 views1 answer
How to make a c++ iostream program restart when finished
C++
5 votes140 views3 answers
Print array c++
C++
0 vote145 views1 answer
My cpp
C++
0 vote153 views1 answer
130 divided by -10
C++