笛卡尔树区间查询最值

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<stack>
using namespace std;
int a[105],n;
int fa[105],ls[105],rs[105];

int build()
{
	stack<int> st;	//存放节点的key值 
	int rt,last;
	for(int i=1;i<=n;++i)
	{
		last=0;
		while(!st.empty())
		{
			if(a[st.top()]<a[i])
			{
				rt=st.top();
				if(rs[rt])
				{
					fa[rs[rt]]=i;
					ls[i]=rs[rt];
				}
				rs[rt]=i;
				fa[i]=rt;
				break;
			}
			last=st.top(); st.pop();
		}
		if(st.empty()&&last)
		{
			fa[last]=i;
			ls[i]=last;
		}
		st.push(i);
	}
	while(!st.empty())	rt=st.top(), st.pop();
	return rt;
}

int query(int root,int l,int r)
{
	while(root<l||root>r)
		root= root<l? rs[root]:ls[root];
	return root;
}

void init()
{
	memset(ls,0,sizeof(ls));
	memset(rs,0,sizeof(rs));
	memset(fa,0,sizeof(fa));
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
		scanf("%d",&a[i]);
	init(); 
	int root=build();
	int x,y;
	scanf("%d%d",&x,&y);
	int i=query(root,x,y);
	printf("%d\n",a[i]);
	return 0;
}