HDU 5443 The Water Problem（水）

来源：互联网发布：量化投资中的算法理论编辑：程序博客网时间：2024/06/11 18:47

思路：没有修改，只有询问操作，可以RMQ，线段树等各种方法，当然也可以暴力

#include<bits/stdc++.h>using namespace std;const int maxn = 1005;int a[maxn];int main(){    int T;scanf("%d",&T);while(T--){        int n;scanf("%d",&n);for(int i = 1;i<=n;i++)scanf("%d",&a[i]);int q;scanf("%d",&q);while(q--){int l,r,ans=-1;scanf("%d%d",&l,&r);for(int i = l;i<=r;i++)                ans = max(ans,a[i]);printf("%d\n",ans);}}}

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

representing the size of the water source. Given a set of queries each containing

integers

and

, please find out the biggest water source between

and

Input

First you are given an integer

indicating the number of test cases. For each test case, there is a number

on a line representing the number of water sources.

integers follow, respectively

, and each integer is in

. On the next line, there is a number

representing the number of queries. After that, there will be

lines with two integers

and

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

3110011 151 2 3 4 551 21 32 43 43 531 999999 141 11 22 33 3

Sample Output

1002344519999999999991

0 0