Method buildBetweenZero

Data Structures/SQRT Tree.cpp:58–64

  }

  inline void buildBetweenZero() {
    int bSzLog = (llg + 1) >> 1;
    for (int i = 0; i < indexSz; i++) {
      v[n + i] = suf[0][i << bSzLog];
    }
    build(1, n, n + indexSz, (1 << llg) - n);
  }

  inline void updateBetweenZero(int bid) {
    int bSzLog = (llg + 1) >> 1;