This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n, m, a[5006];
int main()
{
cin>>n>>m;
for(int i = 0; i < n; i++){
cin>>a[i];
}
for(int i = 0; i < m; i++){
int l, r, s, mx, q = 0;
cin>>l>>r>>s;
mx = a[l];
for(int j = l + 1; j <= r; j++){
if(a[j] > mx){
mx = a[j];
}
else {
if(a[j] + mx > s){
cout<<0;
q = 1;
break;
}
}
}
if(q == 0)cout<<1;
cout<<endl;
}
return 0;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |