# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330716 | vitkishloh228 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 0 ms | 0 KiB |
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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<int> a(n);
for (int& i : a) cin >> i;
while (q--) {
int l, r, c;
cin >> l >> r >> c;
--l, --r;
int ans = 0;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
if (a[i] > a[j]) {
ans = max(ans, a[i] + a[j]);
}
}
}
if (ans <= k) {
cout << 1 << endl;
}
else cout << 0 << endl;
}
}