/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 vote232 views1 answer
Explicit conversion casting
C++
0 vote181 views1 answer
Set iterator
C++
0 vote172 views1 answer
Std::gcd
C++
1 vote175 views1 answer
What is _asm in C++
C++
0 vote177 views1 answer
C++ static array in Klasse
C++
0 vote219 views1 answer
C++ require keyword
C++
0 vote168 views1 answer
Factorial using recursion cpp
C++
2 votes203 views1 answer
MPI_file_open
C++
19 votes169 views2 answers
Files c++
C++
0 vote190 views1 answer
Printing in column c++
C++