/* -*- coding: utf-8 -*- * * 3198.cc: No.3198 Monotonic Query - yukicoder */ #include #include #include using namespace std; /* constant */ const int MAX_N = 200000; /* typedef */ template struct SegTreeMax { int e2; vector nodes; T defv; SegTreeMax() {} void init(int n, T _defv) { defv = _defv; for (e2 = 1; e2 < n; e2 <<= 1); nodes.assign(e2 * 2, defv); } T &geti(int i) { return nodes[e2 - 1 + i]; } void seti(int i, T v) { geti(i) = v; } void setall() { for (int j = e2 - 2; j >= 0; j--) nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]); } void set(int i, T v) { int j = e2 - 1 + i; nodes[j] = v; while (j > 0) { j = (j - 1) / 2; nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]); } } T max_range(int r0, int r1, int k, int i0, int i1) { if (r1 <= i0 || i1 <= r0) return defv; if (r0 <= i0 && i1 <= r1) return nodes[k]; int im = (i0 + i1) / 2; T v0 = max_range(r0, r1, k * 2 + 1, i0, im); T v1 = max_range(r0, r1, k * 2 + 2, im, i1); return max(v0, v1); } T max_range(int r0, int r1) { return max_range(r0, r1, 0, 0, e2); } }; /* global variables */ SegTreeMax st; /* subroutines */ /* main */ int main() { int qn; scanf("%d", &qn); int n = 0; st.init(MAX_N, 0); while (qn--) { int op, x; scanf("%d%d", &op, &x); if (op == 1) { st.set(n++, x); } else { auto e = st.max_range(n - x, n); printf("%d\n", e); } } return 0; }