#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) //#include //namespace mp=boost::multiprecision; //using Bint=mp::cpp_int; templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b>N; vectorA(N);cin>>A; vectorP(N),Q(N); vectorX(N,1e18),Y(N,1e18); REP(i,N){ chmin(X[LB(X,A[i])],A[i]); chmin(Y[LB(Y,-A[i])],-A[i]); P[i]=LB(X,1e18)-1; Q[i]=LB(Y,1e18)-1; } REP(i,N)X[i]=Y[i]=1e18; ll ans=0; RREP(i,N){ chmin(X[LB(X,A[i])],A[i]); chmin(Y[LB(Y,-A[i])],-A[i]); ll p=LB(X,1e18),q=LB(Y,1e18); chmax(ans,min(p,P[i])); chmax(ans,min(q,Q[i])); } cout<