The Water Problem
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 921 Accepted Submission(s): 731
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
a
1
,a
2
,a
3
,...,a
n![]()
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
a
l![]()
and
a
r![]()
.
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
a
1
,a
2
,a
3
,...,a
n![]()
, and each integer is in
{1,...,10
6
}
. 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#include<stdio.h> #include<string.h> #include<algorithm> #define N 1010 using namespace std; int a[N]; struct zz { int l; int r; int m; }q[4*N]; void build(int gen,int l,int r) { q[gen].l=l; q[gen].r=r; if(l==r) { q[gen].m=a[l]; return ; } int mid=(l+r)/2; build(gen<<1,l,mid); build(gen<<1|1,mid+1,r); q[gen].m=max(q[gen<<1].m,q[gen<<1|1].m); } int query(int gen,int l,int r) { if(l<=q[gen].l&&r>=q[gen].r) return q[gen].m; int mid=(q[gen].l+q[gen].r)/2; int cnt; if(r<=mid) cnt=query(gen<<1,l,r); else if(l>=mid+1) cnt=query(gen<<1|1,l,r); else cnt=max(query(gen<<1,l,mid),query(gen<<1|1,mid+1,r)); return cnt; } int main() { int t,n,m,i; int x,y; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&a[i]); build(1,1,n); scanf("%d",&m); while(m--) { scanf("%d%d",&x,&y); printf("%d\n",query(1,x,y)); } } return 0; }