hdu 5443 The Water Problem 水题 2015 ACM/ICPC Asia Regional Changchun Online

The Water Problem

Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 264    Accepted Submission(s): 220

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

2015 ACM/ICPC Asia Regional Changchun Online

 

Recommend

hujie   |   We have carefully selected several similar problems for you:   5449  5448  5447  5446  5445 

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI 3.1415926535897932384626
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n)  for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n)  for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n)  for(int i=(n) ;i>=0 ;i--)
#define  lson   num<<1,le,mid
#define rson    num<<1|1,mid+1,ri
#define MID   int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk    make_pair
#define _f     first
#define _s     second

using namespace std;
//const int INF=    ;
typedef long long ll;
//const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
const int INF =0x3f3f3f3f;
const int maxn=1000+10    ;
//const int maxm=    ;
//by yskysker123
int dp[maxn][maxn];
int a[maxn];
int n,m;
int le,ri;
int main()
{
    int T;scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
             scanf("%d",&a[i]);

        }
        for(int i=1;i<=n;i++)
        {
            dp[i][i]=a[i];
            for(int j=i+1;j<=n;j++)
            {
                dp[i][j]=max(a[j],dp[i][j-1]);
            }
        }
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d",&le,&ri);
            printf("%d\n",dp[le][ri]);
        }



    }


    return 0;
}