#include using namespace std; using i64 = long long; #define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++) /* include file*/ #include #include using namespace std; int Q; vector T,X; vector Xs; template struct Segment { using Func = function; vector node; Monoid ide; int n = 1; Func bin_f; Func update_f; Segment(const vector& init, Monoid ide_, Func f_, Func u_f) : bin_f(f_), ide(ide_), update_f(u_f) { int sz = init.size(); while (n < sz) n *= 2; node.assign(n * 2 - 1, ide); for (int i = 0; i < sz; i++) node[i + n - 1] = init[i]; for (int i = n - 2; i >= 0; i--) node[i] = bin_f(node[i * 2 + 1], node[i * 2 + 2]); } void update(int i, Monoid x) { i += n - 1; node[i] = update_f(node[i], x); while (i) { i = (i - 1) / 2; node[i] = bin_f(node[i * 2 + 1], node[i * 2 + 2]); } } Monoid get_inter(int a, int b, int k = 0, int l = 0, int r = -1) { if (r < 0) r = n; if (a <= l && r <= b) return node[k]; if (r <= a || b <= l) return ide; Monoid lm = get_inter(a, b, k * 2 + 1, l, (l + r) / 2); Monoid rm = get_inter(a, b, k * 2 + 2, (l + r) / 2, r); return bin_f(lm, rm); } }; // http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2730414#1 // http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2730425#1 int main(){ cin >> Q; T.resize(Q); X.resize(Q); i64 SUM = 0; rep(i,0,Q - 1){ cin >> T[i] >> X[i]; if(T[i] == 3){ SUM += X[i]; } if(T[i] == 1) Xs.push_back(X[i] - SUM); } sort(Xs.begin(),Xs.end()); Xs.erase(unique(Xs.begin(), Xs.end()),Xs.end()); rep(i,0,Q - 1){ if(T[i] == 1) X[i] = lower_bound(Xs.begin(), Xs.end(), X[i]) - Xs.begin(); } vector R; Segment seg(vector(Xs.size(),0),0,[](i64 a,i64 b){ return a + b; },[](i64 a,i64 b){ return a + b; }); i64 BASE = 0; rep(i,0,Q - 1){ if(T[i] == 1){ seg.update(X[i], 1); R.push_back(X[i]); } if(T[i] == 2){ seg.update(R[X[i] - 1],-1); } if(T[i] == 3){ BASE += X[i]; } int l = 0; int r = Q + 1; while(r - l > 1){ int mid = (l + r) / 2; int idx = ::lower_bound(Xs.begin(),Xs.end(),mid - BASE) - Xs.begin(); if(idx == Xs.size()){ r = mid; continue; } if(mid <= seg.get_inter(idx,seg.n)){ l = mid; } else{ r = mid; } } cout << l << endl; } }