Submission #1326228

#	Time	Username	Problem	Language	Result	Execution time	Memory
1326228		gustavo_d	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	1 ms	332 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 500;

int arr[MAXN];

int main() {
    cin.tie(0)->sync_with_stdio(false);

    int n, qs; cin >> n >> qs;
    for (int i=0; i<n; i++) cin >> arr[i];
    for (int q=0; q<qs; q++) {
        int l, r, x; cin >> l >> r >> x; l--; r--;
        int mx = 0;
        for (int i=l; i<=r; i++) {
            for (int j=i+1; j<=r; j++) {
                mx = max(mx, arr[i] - arr[j]);
            }
        }
        cout << (mx <= x) << '\n';
    }

    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23