hdu 5443 The Water Problem



找区间内最大值。数据范围，才10*1000*100，果断暴力。

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<sstream>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
int dx[]= {0,1,0,-1};
int dy[]= {1,0,-1,0};
int gcd (const LL &a, const LL &b) {return b==0?a:gcd (b,a%b);}
using namespace std;
int S[1010];
int maxn (int l,int r) {
    int maxx=S[r];
    for (int i=l; i<r; ++i) {
        if (S[i]>maxx) {maxx=S[i];}
    }
    return maxx;
}
int main() {
    int T; scanf ("%d",&T);
    while (T--) {
        memset (S,0,sizeof (S) );
        int n; scanf ("%d",&n);
        for (int i=1; i<=n; ++i) {
            scanf ("%d",&S[i]);
        }
        int q; scanf ("%d",&q);
        while (q--) {
            int l,r;
            scanf ("%d%d",&l,&r);
            printf ("%d\n",maxn (l,r) );
        }
    }
    return 0;
}