Submission #1335898

#TimeUsernameProblemLanguageResultExecution timeMemory
1335898YSH2020Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
0 / 100
3094 ms4336 KiB
#include <bits/stdc++.h>
using namespace std;
#define space ' '
#define endl '\n'

int main() {
	int n,q; cin >> n >> q;
	int s[n]; for (int i = 0; i < n; i++) cin >>s[i];
	while (q--) {
		int a,b,c; cin >> a >> b >> c;
		a--;b--;
		int prefmax=-2e9;
		int ans=0;
		for (int i = a; i <= b; i++) {
			if (prefmax > s[i]) {ans=max(ans, prefmax+s[i]);  prefmax=s[i];}
		}
		if (ans > c) cout << 0 << endl;
		else cout << 1 << endl;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...