# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890038 | 2023-12-20T11:29:24 Z | vjudge1 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; const int N=1e9+7; int a[N]; bool op[N]; int main() { int n,m; cin>>n>>m; op[0]=1; for(int i=1; i<=n; i++){ cin>>a[i]; if(op[i-1] && a[i] >= a[i-1]){ op[i]=1; } } 0 for(int i=1; i<=m; i++){ int l,r,k; cin>>l>>r>>k; bool ans=1; if(op[r]){ cout<<ans<<"\n"; continue; } for(int i=l; i<r; i++){ if(a[i]>a[i+1]){ ans=0; break; } } cout<<ans<<"\n"; } }