Submission #334547

#	Time	Username	Problem	Language	Result	Execution time	Memory
334547		Gurban	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3097 ms	4392 KiB

sortbooks

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

using ll = long long;

const int maxn=1e6+5;
int n,m,a[maxn],l,r,k,mx,ans;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for(int i = 1;i <= n;i++) cin >> a[i];
	while(m--){
		cin >> l >> r >> k;
		mx = 0,ans = 0;
		for(int i = l;i <= r;i++){
			if(mx > a[i]) ans = max(ans,mx+a[i]);
			mx = max(mx,a[i]);
		}
		if(ans <= k) cout<<"1\n";
		else cout<<"0\n";
	}
}

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