#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define rep1(a, i) for(int i = 1; i <= (a); i++)
#define pi pair<int, int>
#define fi first
#define se second
int mod = 1e9+7;
signed main(){
int n; cin >> n;
vector<int> a(n+1, 0);
rep1(n, i) cin >> a[i];
int cur = a[1];
vector<pi> val;
for(int i = 2; i <= n; i++){
if(a[i] < cur){
cur = a[i];
val.pb({i-1, cur});
}
}
int q; cin >> q;
int awan = a[1];
int idx = 0;
int tot = 0;
while(q--){
int t; cin >> t;
if(t == 1){
tot++;
}
else{
int l, r; cin >> l >> r;
while(idx < val.size() && val[idx].fi <= tot){
awan = val[idx].se;
idx++;
}
cout << awan << '\n';
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |