/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 vote162 views1 answer
C++ message box error
C++
0 vote156 views1 answer
Unknown amount of threads cpp
C++
2 votes167 views2 answers
What is typedef
C++
0 vote206 views1 answer
C++ average
C++
1 vote153 views1 answer
Il2cpp unity stuck c#
C++
0 vote168 views1 answer
How to install boost c++ on windows
C++
0 vote165 views1 answer
C++ triangle
C++
0 vote165 views1 answer
Character cin(userInput) in c++
C++
5 votes174 views2 answers
C++ break Statement
C++
0 vote178 views1 answer
C++ calorie calculator using a for loop
C++