#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; const ll mod = 998244353; const ll INF = mod * mod; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef pair LP; typedef vector vec; typedef long double ld; typedef pair LDP; const ld eps = 1e-5; const ld pi = acos(-1.0); struct BIT { private: vector node; int n; public: BIT(int n_) { n = n_; node.resize(n, 0); } //0-indexed void add(int a, ll w) { for (int i = a; i < n; i |= i + 1)node[i] += w; } //[0,a) ll sum(int a) { ll ret = 0; for (int i = a - 1; i >= 0; i = (i&(i + 1)) - 1)ret += node[i]; return ret; } //[a,b) ll sum(int a, int b) { return sum(b) - sum(a); } }; void solve() { int n, q; cin >> n >> q; vector> ngs(n); vector a(n); rep(i, n) { cin >> a[i]; } stack

st; rep(i, n) { while (!st.empty() && st.top().first < a[i]) { st.pop(); } if (!st.empty()) { ngs[st.top().second].push_back(i); } st.push({ a[i],i }); } vector ans(q); vector> v(n); rep(i, q) { int t, l, r; cin >> t >> l >> r; l--; r--; v[l].push_back({ r,i }); } BIT b(n); per(i, n) { rep(j, ngs[i].size()) { b.add(ngs[i][j],-1); } b.add(i, 1); rep(j, v[i].size()) { int r = v[i][j].first; int id = v[i][j].second; ans[id] = b.sum(i, r + 1); } } rep(i, q) { cout << ans[i] << endl; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(50); //init(); solve(); //cout << "finish" << endl; //stop return 0; }