The Water Problem
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 504 Accepted Submission(s): 402
Problem Description
In Land waterless, water is a very limited resource. People always fight for the biggest source of water. Given a sequence of water sources with
a1,a2,a3,...,an
representing the size of the water source. Given a set of queries each containing
2
integers
l
and
r
, please find out the biggest water source between
al
and
ar
.
Input
First you are given an integer
T(T≤10)
indicating the number of test cases. For each test case, there is a number
n(0≤n≤1000)
on a line representing the number of water sources.
n
integers follow, respectively
a1,a2,a3,...,an
, and each integer is in
{1,...,106}
. On the next line, there is a number
q(0≤q≤1000)
representing the number of queries. After that, there will be
q
lines with two integers
l
and
r(1≤l≤r≤n)
indicating the range of which you should find out the biggest water source.
Output
For each query, output an integer representing the size of the biggest water source.
Sample Input
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
Sample Output
100 2 3 4 4 5 1 999999 999999 1
Source
分析:因为n(0≤n≤1000) q(0≤q≤1000) n*q<=1000000 直接暴力
/*
Pro.ID 5443 Exe.Time 0MS
Exe.Memory 1560K Code Len. 551 B
Language G++ Author zhaobing
*/
#include
#include
#include
using namespace std;
int main()
{
int t,a[1001];
scanf("%d",&t);
while(t--)
{
int i,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
int q,l,r;
scanf("%d",&q);
while(q--) ///q次询问 求a[l]~a[r]的最大值
{
scanf("%d%d",&l,&r);
int maxn=0;
for(i=l;i<=r;i++)
maxn=maxn>a[i]?maxn:a[i];
printf("%d\n",maxn);
}
}
return 0;
}