struct SparseTable { vector> st; vector *a; int better(int lidx, int ridx) { return a->at(lidx) <= a->at(ridx) ? lidx : ridx; } void init(vector *vec) { a = vec; st.assign(__lg(sz(*a)) + 1, vector(sz(*a))); iota(all(st[0]), 0); for (int j = 0; (2 << j) <= sz(*a); j++) { for (int i = 0; i + (2 << j) <= sz(*a); i++) { st[j + 1][i] = better(st[j][i] , st[j][i + (1 << j)]); }}} int queryIdempotent(int l, int r) { int j = __lg(r - l); //31 - builtin_clz(r - l); return better(st[j][l] , st[j][r - (1 << j)]); } };