#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 2e5 + 10;
// int tree[N];
int bit1[N];
int bit2[N];
int query(int idx, int *tree) //(Query Time Complexity=O(log(n))
{
    int sum = 0;
    while (idx > 0)
    {
        // cout << idx << " ";
        sum += tree[idx];
        idx -= (idx & -idx);
    }
    // cout << endl;
    return sum;
}
ll RangeSum(int l, int r)
{
    ll sum1 = query(r, bit1) * r - query(r, bit2);               // Sum of elements in [1, r]
    ll sum2 = query(l - 1, bit1) * (l - 1) - query(l - 1, bit2); // Sum of elements in [1, l-1]
    return sum1 - sum2;                                          // Sum of elements in [l,r] = Sum of elements in [0,r] - Sum of elements in [0, l-1]
}
void update(int idx, int val, int n, int *tree) //(Update Time Complexity=O(log(n))
{
    while (idx <= n)
    {
        tree[idx] += val;
        idx += (idx & -idx);
    }
}
void RangeUpdate(int l, int r, int val, int n)
{
    update(l, val, n, bit1);
    update(r + 1, -val, n, bit1);
 
    update(l, val * (l - 1), n, bit2);
    update(r + 1, -val * r, n, bit2);
}
void solve()
{
    int n, q;
    cin >> n;
    vector<int> v(n + 10);
    for (ll i = 1; i <= n; i++) // Tree Construction Time Complexity=O(n*log(n))
    {
        cin >> v[i];
        // update(i, v[i], n);
        // RangeUpdate(i, i, v[i], n);
    }
    for(int i = 1; i < n; i++){
        if(v[i] > v[i + 1]){
            RangeUpdate(i, i, 1, n);
        }
    }
    cin >> q;
    while (q--)
    {
        int type;
        cin >> type;
        if(type == 1){
            int i, x;
            cin >> i >> x;
            v[i] = x;
            int val = RangeSum(i, i);
            if(val == 1){
                if(i + 1 <= n && v[i] <= v[i + 1]){
                    RangeUpdate(i, i, -1, n);
                }
                if(i - 1 > 0 && v[i - 1] <= v[i]){
                    RangeUpdate(i - 1, i - 1, -1, n);
                }
            }
            else{
                if(i + 1 <= n && v[i] > v[i + 1]){
                    RangeUpdate(i, i, 1, n);
                }
                if(i - 1 > 0 && v[i - 1] > v[i]){
                    RangeUpdate(i - 1, i - 1, 1, n);
                }
            }
        }
        else{
            int l, r;
            cin >> l >> r;
            int sum = RangeSum(l, r);
            if(sum == 0){
                cout << "YES" << endl;
            }
            else if(sum == 1){
                if(RangeSum(r, r) == 1){
                    cout << "YES" << endl;
                }
                else{
                    cout << "NO" << endl;
                }
            }
            else{
                cout << "NO" << endl;
            }
        }
    }
}

int32_t main()
{
    Abid_52;
    int t = 1;
    // cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}