/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 vote191 views1 answer
Cin une énumération
C++
2 votes192 views1 answer
2-Dimensional array in c++
C++
0 vote188 views1 answer
Ue_log example
C++
-1 vote180 views1 answer
Execute executable in c++
C++
0 vote261 views1 answer
How togreper
C++
4 votes181 views2 answers
C++ inline if
C++
1 vote198 views1 answer
Array 2d to 1d
C++
0 vote194 views1 answer
'std::ifstream file' has incomplete type and cannot be defined
C++
0 vote197 views1 answer
Shell-Sort C++
C++
0 vote198 views1 answer
Unreal engine delay c++
C++