/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

10 votes123 views2 answers
Difference between programming and coding
C++
0 vote118 views1 answer
C++ excel cell blank cells
C++
0 vote111 views1 answer
Ordine crescente di numeri indefiniti in c++
C++
20 votes109 views2 answers
Find height of a tree
C++
1 vote107 views1 answer
Print std map
C++
3 votes137 views1 answer
What language was c+ written in
C++
-2 votes116 views1 answer
C++ constant
C++
0 vote112 views1 answer
Fstring from float c++ ue4
C++
0 vote120 views1 answer
Mkdir boost filesystem
C++
118 votes230 views6 answers
Reverse string
C++