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:T6e2,#include using namespace std; #define int long long struct node { int lmx, rmx, mx, sum; }; node combine(node l, node r) { node ret; ret.mx = max({l.mx, r.mx, l.rmx + r.lmx}); ret.lmx = max(l.lmx, l.sum+r.lmx); ret.rmx = max(r.rmx, r.sum+l.rmx); ret.sum = l.sum + r.sum; return ret; }; struct pt { int x, y, w; }; const int MX = 4096; node seg[MX*2]; void update(int i, int t) { i += MX; int v = seg[i].mx + t; seg[i].lmx = seg[i].rmx = seg[i].mx = seg[i].sum = v; while(i /= 2) seg[i] = combine(seg[i*2], seg[i*2+1]); } vector> buk[MX]; pt arr[MX]; int n; int32_t main() { ios::sync_with_stdio(0);cin.tie(0); int x, y; cin >> x; vector> p1(x); for(int i=0; i> p1[i].first >> p1[i].second; } cin >> y; vector> p2(y); for(int i=0; i> p2[i].first >> p2[i].second; } int s, b; cin >> s >> b; for(int i=0; i vx, vy; for(int i=0; i

코드 #4902