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>
typedef long long ll;
using namespace std;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    int a[n], dp[n];
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    dp[0]=0;
    for (int i = 1; i < n; i++){
        dp[i]=dp[i-1];
        if(a[i-1]>a[i]){
            dp[i]+=a[i-1];
        }
    }
    for(int i = 0; i<m; i++){
        int l, r, k;
        cin >> l >> r >> k;
        dp[r-1]-dp[l-1]<=k?cout << "1\n":cout << "0\n";
    }
    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... |