1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T650,#include using namespace std; const int MX = 200005; map Amp, Bmp; int acnt = 1, bcnt = 1, input[MX][3], segtree[2*MX]; set> bucket[MX]; vector> students = {{0,0}}; void update(int i, int v) { i += acnt; segtree[i] = max(segtree[i], v); while(i/=2) { segtree[i] = max(segtree[2*i], segtree[2*i+1]); } } int query(int l, int r) { l += acnt, r += acnt; int ret = -1; while(l < r) { if(l&1) ret = max(ret, segtree[l++]); if(r&1) ret = max(ret, segtree[--r]); l /= 2, r /= 2; } return ret; } int main() { ios::sync_with_stdio(0);cin.tie(0); int n; cin >> n; for(int i=0; i> c; if(c == 'D') { cin >> b >> a; Amp[a] = 0; Bmp[b] = 0; input[i][1] = a; input[i][2] = b; } else { cin >> a; input[i][0] = 1; input[i][1] = a; } } for(auto &pr: Amp) pr.second = acnt++; for(auto &pr: Bmp) pr.second = bcnt++; for(int i=0; isecond << '\n'; } else { l = a+1, r = acnt-1; while(l < r) { mid = (l+r)/2; if(query(l, mid+1) >= b) r = mid; else l = mid+1; } it = bucket[l].lower_bound({b,0}); if(it == bucket[l].end()) cout << "NE\n"; else cout << it->second << '\n'; } }

코드 #3418