// @sagorahmedmunna

#include <bits/stdc++.h>
using namespace std;

const int INF = 1.1e9;

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  
  int n;
  cin >> n;
  vector<int> a(n + 2);
  a[n + 1] = INF;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  set<int> st = {INF};
  for (int i = 1; i < n; i++) {
    if (a[i] > a[i + 1]) {
      st.insert(i + 1);
    }
  }
  int q;
  cin >> q;
  while (q--) {
    int type;
    cin >> type;
    if (type == 1) {
      int i, x;
      cin >> i >> x;
      a[i] = x;
      if (a[i] > a[i + 1]) st.insert(i + 1);
      else st.erase(i + 1);
      if (a[i - 1] > a[i]) st.insert(i);
      else st.erase(i);
    } else {
      int l, r;
      cin >> l >> r;
      auto up = st.upper_bound(l);
      cout << (*up > r ? "YES" : "NO") << '\n';
    }
  }
  return 0;
}