Submission #444736

#	Time	Username	Problem	Language	Result	Execution time	Memory
444736		nickyrio	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3095 ms	4212 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> w(n);
    for (int i = 0; i < n; ++i) cin >> w[i];
    for (int i = 0; i < m; ++i) {
        int l, r, k;
        cin >> l >> r >> k;
        int mx = w[l], ans = 0;
        for (int j = l + 1; j <= r; ++j) {
            if (mx > w[j])
                ans = max(ans, mx + w[j]);
            mx = max(mx, w[j]);
        }
        cout << (ans <= k) << '\n';
    }
}

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