题意:
暴力找区间最大值
输入:
3 1 100 1 1 1 5 1 2 3 4 5 5 1 2 1 3 2 4 3 4 3 5 3 1 999999 1 4 1 1 1 2 2 3 3 3
输出:
100 2 3 4 4 5 1 999999 999999 1
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=1005;
int a[maxn];
int n,q,l,r;
int main ()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
scanf("%d",&q);
int tmp;
while(q--)
{
tmp=0;
scanf("%d%d",&l,&r);
for (int i=l; i<=r; i++)
tmp=max(tmp, a[i]);
cout<<tmp<<endl;
}
}
return 0;
}