The Water Problem
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 177 Accepted Submission(s): 143
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
尼玛别人所谓的签到题,都搞了半天,RAQ算法,不说了,都是泪。
#include <iostream>
#include <math.h>
using namespace std;
int a[1010][11];
void RMQ(int n)
{
for(int j=1;j<=10;j++)
for(int i=1;i<=n;i++)
if(i+(1<<j)-1<=n)
{
a[i][j]=max(a[i][j-1],a[i+(1<<(j-1))][j-1]);
}
}
int main()
{
int t,n,q,l,r;
cin>>t;
while(t--)
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i][0];
}
RMQ(n);
cin>>q;
for(int i=1;i<=q;i++)
{
int k,ans;
cin>>l>>r;
k=log10(r-l+1.0)/log10(2.0);
ans=max(a[l][k],a[r-(1<<k)+1][k]);
cout<<ans<<endl;
}
}
return 0;
}