/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

3 votes267 views4 answers
String c++
C++
1 vote256 views1 answer
Comentar todas linhas de uma vez vs code
C++
3 votes239 views1 answer
Deque c++
C++
1 vote260 views2 answers
C++ regex to validate indian phone number pattern
C++
1 vote252 views1 answer
Certificate exe application
C++
0 vote303 views3 answers
11
C++
0 vote251 views1 answer
Std vector c++
C++
3 votes283 views1 answer
Vector unique in c++
C++
0 vote249 views1 answer
How creat matrix column in c++
C++
23 votes259 views1 answer
C++ reverse vector
C++