Submission #973381

#	Time	Username	Problem	Language	Result	Execution time	Memory
973381		colossal_pepe	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3035 ms	4360 KiB

sortbooks

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

int n, m;
vector<int> a;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    if (n > 5000) exit(0);
    cin >> n >> m;
    a.resize(n);
    for (int &x : a) {
        cin >> x;
    }
    while (m--) {
        int l, r, k;
        cin >> l >> r >> k;
        l--, r--;
        int mn = a[r], diff = 0;
        for (int i = r - 1; i >= l; i--) {
            diff = max(diff, a[i] - mn);
            mn = min(mn, a[i]);
        }
        cout << (diff <= k) << '\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