#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N; double X[202020],Y[202020]; template struct ConvexHullOnline { const V inf=1LL<<40+1; const int cmptype=0; // 0-max 1-min map Q,PR; // Q[a]=b -> a*x+b, P[a]=c ax+b is best unti x<=c PR[c]=a unordered_map P; ConvexHullOnline() { Q[inf]=Q[-inf]=-inf*inf;} int ok(pair A,pair B, pair C) { // max or min if(A.first==-inf && C.first==inf) return 1; return ((B.second-A.second)*(B.first-C.first)<=(C.second-B.second)*(A.first-B.first)); } bool bad(typename map::iterator it) { if(it==Q.begin() || next(it)==Q.end() || next(it)->first==inf || prev(it)->first==-inf) return false; return ok(*prev(it),*it,*next(it))==0; } void erase(typename map::iterator it) { PR.erase(P[it->first]); P.erase(it->first); Q.erase(it);} void update(typename map::iterator it) { if(next(it)==Q.end() || it==Q.begin()) return; auto it2=next(it); if(it2->first==inf) { P[it->first]=inf; PR[inf]=it->first; } else { P[it->first]=(it2->second-it->second)/(it->first-it2->first); PR[P[it->first]]=it->first; } } void add(V a, V b) { // add ax+b if(cmptype) a=-a, b=-b; if(Q.count(a)) if(Q[a]==b || Q[a]>b) return; Q[a]=b; auto it=Q.find(a); if(bad(it)) return (void)Q.erase(it); while(bad(next(it))) erase(next(it)); while(bad(prev(it))) erase(prev(it)); PR.erase(P[it->first]); P.erase(it->first); if(prev(it)!=Q.begin()) PR.erase(P[prev(it)->first]); P.erase(prev(it)->first); update(it);update(prev(it)); } V query(V x) { auto it=PR.lower_bound(x); return (it->second*x+Q[it->second])*(cmptype?-1:1); } }; ConvexHullOnline cho; void solve() { int i,j,k,l,r,x,y; string s; cin>>N; double ma=0; double my=0; FOR(i,N) { cin>>X[i]>>Y[i]; cho.add(-Y[i],X[i]); cho.add(Y[i],-X[i]); my=max(my,abs(Y[i])); if(Y[i]==0) { ma=abs(X[i]*my); } else { ma=max(ma,abs(Y[i]*cho.query(X[i]/Y[i]))); } } cout<<(ll)(round(ma))<