1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-8bf5a5fa194d2ba8.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-8bf5a5fa194d2ba8.js"],"CodeViewer"] 1c:T545,#include #define all(v) v.begin(), v.end() #define prs(v) sort(all(v)); v.erase(unique(all(v)), v.end()) using namespace std; using ll = long long; using P = pair; const ll inf = 1e10 + 7; int main(){ cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector

A(n); for(auto &[a, b] : A)cin >> a >> b, b <<= 1; sort(all(A)); vector Rx(n, 0ll), Rn(n, inf); Rx[n - 1] = Rn[n - 1] = A[n - 1].second; for(int s = n - 2; s >= 0; s--){ Rx[s] = max(Rx[s + 1], A[s].second); Rn[s] = min(Rn[s + 1], A[s].second); } auto jud = [&](ll mx){ int i = 0; while(i < n && A[i].second <= mx)i++; if(!i && !A[i].first)return 0; if(i >= n - 1)return 1; vector Lx(n, 0ll), Ln(n, inf); Lx[i] = Ln[i] = A[i].second; for(int s = i + 1; s < n; s++){ Lx[s] = max(Lx[s - 1], A[s].second); Ln[s] = min(Ln[s - 1], A[s].second); } for(int s = i; s < n - 1; s++){ if(Lx[s] - Ln[s] <= 2 * mx && Rx[s + 1] - Rn[s + 1] <= 2 * mx){ if(Lx[s] - mx <= Rn[s] + mx)return 1; } } return 0; }; ll l = -1, r = 2e9 + 7; while(l + 1 < r){ ll m = (l + r) >> 1; (jud(m) ? r : l) = m; } cout << r / 2 << "." << r % 2 * 5 << "\n"; }5:["$","div",n

코드 #1564