/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

1 vote120 views1 answer
How to put bitset into a string in c++
C++
3 votes128 views8 answers
Yeet
C++
0 vote126 views1 answer
C++ suare
C++
9 votes127 views2 answers
Delete last char of string C++
C++
1 vote112 views1 answer
Vector2 c++
C++
4 votes127 views2 answers
C++ reading string
C++
0 vote132 views1 answer
What was the piep piper app
C++
0 vote129 views1 answer
Sum of first and last digit of a number in C++
C++
6 votes104 views2 answers
Index string c++
C++
1 vote122 views4 answers
Convert preorder to postorder calculator
C++