/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 vote338 views1 answer
Max element in an array with the index in c++
C++
7 votes356 views2 answers
How to concatenate vectors in c++
C++
1 vote341 views2 answers
Cpp compare strings
C++
1 vote334 views1 answer
Regex for phone number c++
C++
-1 vote331 views4 answers
How to say hello world in c++
C++
0 vote327 views1 answer
C++ find object in vector by attribute
C++
0 vote305 views4 answers
C++ initialize vector of vector with size
C++
0 vote337 views1 answer
Set iterator
C++
5 votes332 views2 answers
C++ break Statement
C++
2 votes349 views1 answer
Print a string with printf in c++
C++