不想整一次循环了,反正也是基础题

#include<iostream> 
using namespace std; 
int n,a[1005],m,l,r,maxx=-1;
int main(){
	cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    cin >> m;
    for(int i = 1; i <= m; i++){
        cin >> l >> r;
        for(;l <= r; l++)
            if(a[l] > maxx) maxx = a[l];
        cout << maxx << endl;
        maxx = -1;
    }
    return 0;
}