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:T730,#include using namespace std; const int MX = 65536, INF = 1e9 + 7; int N, M, seg[MX * 2]; pair observed[MX]; int query(int l, int r) { int mx = 0; for(l += MX, r += MX; l < r; l >>= 1, r >>= 1) { if(l & 1) { mx = max(mx, seg[l++]); } if(r & 1) { mx = max(mx, seg[--r]); } } return mx; } int rain_at_year(int x) { auto it = lower_bound(observed, observed + N, make_pair(x, -1)); if(it == observed + N || it->first != x) { return 0; } return it->second; } int32_t main() { cin.tie(0)->sync_with_stdio(0); cin >> N; for(int i = 0; i < N; i++) { auto &[a, b] = observed[i]; cin >> a >> b; seg[i + MX] = b; } for(int i = MX - 1; i; i--) { seg[i] = max(seg[i * 2], seg[i * 2 + 1]); } cin >> M; while(M--) { int y, x; cin >> y >> x; int yi = upper_bound(observed, observed + N, make_pair(y, INF)) - observed; int xi = lower_bound(observed, observed + N, make_pair(x, 0)) - observed; int mx = query(yi, xi); int yr = rain_at_year(y), xr = rain_at_year(x); if(!xr && !yr) { cout << "maybe\n"; } else if(!xr && yr) { cout << (mx < yr ? "maybe" : "false") << '\n'; } else if(xr && !yr) { cout << (mx < xr ? "maybe" : "false") << '\n'; } else { if(yr < xr)

코드 #3774