제출 #536115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
536115		MurotY	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	414 ms	17932 KiB

sortbooks

#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ss second
#define ll long long
using namespace std;
const int N=1e6+7, M=1e9+7;
ll a[N], dp[N];
void solve()
{
	ll n, m, mn=1e18;
	cin >> n >> m;
	for (int i=1;i<=n;i++) cin >> a[i], mn=min(mn, a[i]);
	dp[1]=1;
	for (int i=2;i<=n;i++) {
		if (a[i] >= a[i-1]) dp[i]=dp[i-1]+1;
		else dp[i]=dp[i-1];
	}
	
//	for (int i=1;i<=n;i++) cout << dp[i] <<" ";
	while (m--){
		ll l, r, k;
		cin >> l >> r >> k;
		
		if (l == r) {
			cout << "1\n";
			continue;
		}
		if (mn > k){
			if (dp[r]-dp[l-1] == r-l+1) cout <<"1\n";
			else cout << "0\n";
			continue;
		}
		/*for (int i=l;i<=r;i++){
			ll lw=prev(upper_bound(a+i, a+n+1, a[i]));
		}*/
	}
	return ;
}
int main()
{
	ios;
	int t=1;
//	cin >> t;
	while (t--){
		solve(); 
		cout <<"\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