CSES Problem 1647 - Static Range Minimum Queries
CSES Problem 1647 - Static Range Minimum Queries

coding kata 2 - AC!!! [14m9s]

Analysis
--------
- implementation of sparse table method (see CPH p.85)
- see `staticRangeMinimumQueries2.cpp`

presubmit bugs:
- writing into unallocated memory in STL vector
  - i.e. `sparseTable[exp][pos](...)`
    - instead of `sparseTable[exp].PB(...)`
    => BEWARE OF WRITING TO TO UNALLOCATED MEMORY!!!
       - ESPECIALLY IN CONTAINERS
    => STICK TO PUSH_BACK() ONCE USED!
- WA due to off-by-1 bugs
  - a,b not pre-decremented by 1
    <- 1-based indexing in the input
    -> sparse table is 0-based indexing
    => ALWAYS PRE-EMPTIVELY CONVERT TO 0-BASED INDEXING BY DEFAULT!

Signed-off-by: Karel Ha <70f8965fdfb04f1fc0e708a55d9e822c449f57d3@gmail.com>

mathemage/CompetitiveProgramming,mathemage/CompetitiveProgramming,mathemage/CompetitiveProgramming,mathemage/CompetitiveProgramming,mathemage/CompetitiveProgramming,mathemage/CompetitiveProgramming