D. Rorororobot(RMQ)

只需要判读起点终点的坐标之差是否是k的倍数，然后贪心让较高的点走到最高能到达的点，查询一下区间最大值，若大于最大值即可行。

查询区间最大值可以用st表或者线段树

#include <iostream>
#include<cstring>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<queue>
#include<bitset>
#include<vector>
#include<map>
#define int long long
#define endl '\n'
#define lowbit(x) x &(-x)
#define mh(x) memset(x, -1, sizeof h)
#define debug(x) cerr << #x << "=" << x << endl;
#define brk exit(0);
using namespace std;
const int N = 2e5 + 10;
const int M = 2 * N;
const int mod = 998244353;
const double esp = 1e-6;
const double pi = acos(-1);
typedef pair<int, int> PII;
typedef long long ll;
int a[N];
int f[N][18];
int n, m;
void stinit()
{
	for (int j = 0; j < 18;++j)
	{
		for (int i = 1; i + (1 << j) - 1 <= m;++i)
		{
				if(!j)
					f[i][j] = a[i];
				else
					f[i][j] = max(f[i][j - 1], f[i + (1 << j-1)][j - 1]);
		}
	}
}
int rmq(int l,int r)
{
	int len = r - l + 1;
	int k = log(len) / log(2);
	return max(f[l][k], f[r - (1 << k) + 1][k]);
}
void solve()
{
	cin >> n >>m;
	for (int i = 1; i <= m;i++)
	{
		cin >> a[i];
	}
	stinit();
	int q;
	cin >> q;
	while(q--)
	{
		int s, t, e, d,k;
		cin >> s >> t >> e >> d>>k;
		if(abs(s-e)%k||abs(t-d)%k)
		{
			cout << "NO" << endl;
			continue;
		}
		int maxx = max(s, e);
		maxx = (n - maxx) / k * k + maxx;//找出较高的点能到达的位置
		if(maxx>rmq(min(t,d),max(t,d)))
			cout << "YES" << endl;
		else
			cout << "NO" << endl;

	}
}
signed main(){
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int T=1;
	//cin >> T;
	while(T--)
		solve();
	return 0;
}