#include #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define rep(i,n) for(int i=0;i<(int)(n);i++) #define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++) #define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++) #define codefor int test;scanf("%d",&test);while(test--) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define yes(ans) if(ans)printf("yes\n");else printf("no\n") #define Yes(ans) if(ans)printf("Yes\n");else printf("No\n") #define YES(ans) if(ans)printf("YES\n");else printf("NO\n") #define popcount(v) __builtin_popcount(v) #define vector2d(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define vector3d(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) using namespace std; using ll = long long; template using rpriority_queue = priority_queue, greater>; const int MOD=1000000007; const int MOD2=998244353; const int INF=1<<30; const ll INF2=1LL<<60; void scan(int& a){scanf("%d",&a);} void scan(long long& a){scanf("%lld",&a);} templatevoid scan(pair& p){scan(p.first);scan(p.second);} templatevoid scan(tuple& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));} template void scan(array& a){ for(auto&& i : a) scan(i);} template void scan(T& a){cin>>a;} template void scan(vector& vec){for(auto&& it:vec)scan(it);} void in(){} template void in(Head& head, Tail&... tail){scan(head);in(tail...);} void print(const int& a){printf("%d",a);} void print(const long long& a){printf("%lld",a);} void print(const double& a){printf("%.15lf",a);} templatevoid print(const pair& p){print(p.first);putchar(' ');print(p.second);} template void print(const T& a){cout< void print(const vector& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}} void out(){putchar('\n');} template void out(const T& t){print(t);putchar('\n');} template void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);} template void dprint(const T& a){cerr< void dprint(const vector& vec){if(vec.empty())return;cerr< void debug(const T& t){dprint(t);cerr< void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);} ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;} ll updivide(ll a,ll b){return (a+b-1)/b;} template void chmax(T &a,const T b){if(b>a)a=b;} template void chmin(T &a,const T b){if(b struct lazy_segtree { public: lazy_segtree() : lazy_segtree(0) {} lazy_segtree(int n) : lazy_segtree(std::vector(n, e())) {} lazy_segtree(const std::vector& v) : _n(int(v.size())) { log = internal_bit::ceil_pow2(_n); size = 1 << log; d = std::vector(2 * size, e()); lz = std::vector(size, id()); for (int i = 0; i < _n; i++) d[size + i] = v[i]; for (int i = size - 1; i >= 1; i--) { update(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } S get(int p) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); return d[p]; } S prod(int l, int r) { assert(0 <= l && l <= r && r <= _n); if (l == r) return e(); l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push(r >> i); } S sml = e(), smr = e(); while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_prod() { return d[1]; } void apply(int p, F f) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = mapping(f, d[p]); for (int i = 1; i <= log; i++) update(p >> i); } void apply(int l, int r, F f) { assert(0 <= l && l <= r && r <= _n); if (l == r) return; l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } { int l2 = l, r2 = r; while (l < r) { if (l & 1) all_apply(l++, f); if (r & 1) all_apply(--r, f); l >>= 1; r >>= 1; } l = l2; r = r2; } for (int i = 1; i <= log; i++) { if (((l >> i) << i) != l) update(l >> i); if (((r >> i) << i) != r) update((r - 1) >> i); } } template int max_right(int l) { return max_right(l, [](S x) { return g(x); }); } template int max_right(int l, G g) { assert(0 <= l && l <= _n); assert(g(e())); if (l == _n) return _n; l += size; for (int i = log; i >= 1; i--) push(l >> i); S sm = e(); do { while (l % 2 == 0) l >>= 1; if (!g(op(sm, d[l]))) { while (l < size) { push(l); l = (2 * l); if (g(op(sm, d[l]))) { sm = op(sm, d[l]); l++; } } return l - size; } sm = op(sm, d[l]); l++; } while ((l & -l) != l); return _n; } template int min_left(int r) { return min_left(r, [](S x) { return g(x); }); } template int min_left(int r, G g) { assert(0 <= r && r <= _n); assert(g(e())); if (r == 0) return 0; r += size; for (int i = log; i >= 1; i--) push((r - 1) >> i); S sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!g(op(d[r], sm))) { while (r < size) { push(r); r = (2 * r + 1); if (g(op(d[r], sm))) { sm = op(d[r], sm); r--; } } return r + 1 - size; } sm = op(d[r], sm); } while ((r & -r) != r); return 0; } private: int _n, size, log; std::vector d; std::vector lz; void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); } void all_apply(int k, F f) { d[k] = mapping(f, d[k]); if (k < size) lz[k] = composition(f, lz[k]); } void push(int k) { all_apply(2 * k, lz[k]); all_apply(2 * k + 1, lz[k]); lz[k] = id(); } }; using S=int; using F=int; //単位元 S e2(){return 0;} //演算 S op2(S l,S r){return max(l,r);} //xにfを作用させた時の値の変化 S mapping(F f,S x){return max(x,f);} //gを演算した後にfを演算させると演算子はどうなるか F composition(F f, F g){return max(f,g);} //作用させても変化させないもの F id(){return 0;} template struct SparseTable { vector> table; vector lookup; int LOGV=0, _n; SparseTable(const vector &v) { _n=v.size(); while(_n>>LOGV)LOGV++; table.assign(LOGV,vector(_n)); lookup.resize(_n+1); for(int i = 0; i < _n; i++) table[0][i] = v[i]; for(int i = 1; i < LOGV; i++) { for(int j = 0; j + (1 << i) <= _n; j++) { table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]); } } lookup[1]=0; for(int i = 2; i < lookup.size(); i++) { lookup[i] = lookup[i >> 1] + 1; } } T prod(const int l, const int r){ assert(0 <= l && l <= r && r <= _n); if(l==r)return e(); int b = lookup[r - l]; return op(table[b][l],table[b][r - (1< a(n),b(n); in(a,b); SparseTable st(b); lazy_segtree seg(a); rep(i,n){ if(a[i]>b[i])break; int l=0,r=n+1,mid; while(l=a[i])l=mid+1; else r=mid; } seg.apply(i,i+l-1,a[i]); l=0,r=n+1; while(l=0&&st.prod(i+1-mid,i+1)>=a[i])l=mid+1; else r=mid; } seg.apply(i+1-(l-1),i+1,a[i]); } vector c(n); rep(i,n)c[i]=seg.get(i); Yes(c==b); } }