hdu 5443 The Water Problem（長春網絡賽——暴力）

hdu 5443 The Water Problem（長春網絡賽——暴力）

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 witha1,a2,a3,...,anrepresenting the size of the water source. Given a set of queries each containing2integerslandr, please find out the biggest water source betweenalandar.  
Input   First you are given an integerT(T≤10)indicating the number of test cases. For each test case, there is a numbern(0≤n≤1000)on a line representing the number of water sources.nintegers follow, respectivelya1,a2,a3,...,an, and each integer is in{1,...,106}. On the next line, there is a numberq(0≤q≤1000)representing the number of queries. After that, there will beqlines with two integerslandr(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:56645663566256615660   題目大意：給出n個水池的水量，找出區間內最大的水量。

求區間最值，正常都采用線段樹的方法，但是這題數據量不大，所有暴力就過了~

詳見代碼。

#include 
#include 

using namespace std;

int main()
{
    int t;
    int a[1010],l,r;
    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 Max=0;
            scanf("%d%d",&l,&r);
            for (int i=l; i<=r; i++)
            {
                if (a[i]>Max)
                    Max=a[i];
            }
            cout<