HDU 5443 The Water Problem 2015 ACM/ICPC Asia Regional Changchun Online

#include<cstdio>
const int maxn = 1100;
int a[maxn];
int q,l,r;
int T,n;
int main()
{
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
scanf("%d",&q);
while(q--){
scanf("%d %d",&l,&r);
int x=0;
for(int i=l;i<=r;i++)
if(a[i]>x) x=a[i];
printf("%d\n",x);
}
}
return 0;
}