#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const int N=1111;
int tree[N*4];
void Build(int num,int Le,int Ri)
{
scanf("%d",&tree[num]);
return;
}
int mid=(Le+Ri)/2;
Build(num*2,Le,mid);
Build(num*2+1,mid+1,Ri);
tree[num]=max(tree[num*2],tree[num*2+1]);
}
int Query(int num,int Le,int Ri,int L,int R)
{
if (L<=Le&&R>=Ri)
{
return tree[num];
}
int mid=(Le+Ri)/2;
if(L > mid)
return Query(num*2+1,mid+1,Ri,L,R);
else if(R <= mid)
return Query(num*2,Le,mid,L,R);
else
return max(Query(num*2,Le,mid,L,mid),Query(num*2+1,mid+1,Ri,mid+1,R));
}
int main()
{
int T;
scanf("%d",&T);
while (T--)
{
int n;
scanf("%d",&n);
Build(1,1,n);
int Q;
scanf("%d",&Q);
while (Q--)
{
int l,r;
scanf("%d%d",&l,&r);
printf("%d\n",Query(1,1,n,l,r));
}
}
}
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const int N=1111;
int tree[N*4];
void Build(int num,int Le,int Ri)
{
if (Le==Ri){
scanf("%d",&tree[num]);
return;
}
int mid=(Le+Ri)/2;
Build(num*2,Le,mid);
Build(num*2+1,mid+1,Ri);
tree[num]=max(tree[num*2],tree[num*2+1]);
}
int Query(int num,int Le,int Ri,int L,int R)
{
if (L<=Le&&R>=Ri)
{
return tree[num];
}
int mid=(Le+Ri)/2;
if(L > mid)
return Query(num*2+1,mid+1,Ri,L,R);
else if(R <= mid)
return Query(num*2,Le,mid,L,R);
else
return max(Query(num*2,Le,mid,L,mid),Query(num*2+1,mid+1,Ri,mid+1,R));
}
int main()
{
int T;
scanf("%d",&T);
while (T--)
{
int n;
scanf("%d",&n);
Build(1,1,n);
int Q;
scanf("%d",&Q);
while (Q--)
{
int l,r;
scanf("%d%d",&l,&r);
printf("%d\n",Query(1,1,n,l,r));
}
}
}