请求降低时限

#include<bits/stdc++.h>
using namespace std;
int n , q , l , r , a[100005];
struct node
{
	int l , r , tag;
};
struct xds
{
	node tree[400005];
	inline void build(int p , int l , int r)
	{
		tree[p].l = l;
		tree[p].r = r;
		if(l == r)
		{
			tree[p].tag = a[l];
			return;
		}
		int mid = (l + r) / 2;
		build(p * 2 , l , mid);
		build(p * 2 + 1 , mid + 1 , r);
		tree[p].tag = max(tree[p * 2].tag , tree[p * 2 + 1].tag);
		return;
	}
	inline int query(int p , int l , int r)
	{
		if(l <= tree[p].l && tree[p].r <= r)
		{
			return tree[p].tag;
		}
		int cnt = 0;
		if(tree[p * 2].r >= l)
		{
			cnt = max(cnt , query(p * 2 , l , r));
		}
		if(r >= tree[p * 2 + 1].l)
		{
			cnt = max(cnt , query(p * 2 + 1 , l , r)); 
		}
		return cnt;
	}
}xds;
inline int read()
{
	int x=0,f=1;char ch=getchar_unlocked();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar_unlocked();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar_unlocked();}
	return x*f;
}
int main()
{
	n = read();
	q = read();
	for(int i = 1 ; i <= n ; i++)
	{
		cin >> a[i];
	}
	xds.build(1 , 1 , n);
	while(q--)
	{
		l = read();
		r = read();
		printf("%d\n" , xds.query(1 , l , r));
	}
	return 0; 
}