hdu5443 The Water Problem

标签：水题

---

题目链接
方法一

/*    输出water[l, r]中的最大值*/#include <stdio.h>const int maxn = 1005;int water[maxn];int main(){    int T;    scanf("%d", &T);    while(T--)    {        int n, q, l, r;        scanf("%d", &n);        for(int i = 1; i <= n; i++){            scanf("%d", &water[i]);        }        scanf("%d", &q);        for(int i = 0; i < q; i++)        {            scanf("%d %d", &l, &r);            int maxwater = water[l];            for(int j = l + 1; j <= r; j++)                if(water[j] > maxwater)  maxwater = water[j];            printf("%d\n", maxwater);        }    }    return 0;}

方法二

/*    输出water[l, r]中的最大值*/#include <stdio.h>#include <algorithm>using namespace std;const int maxn = 1005;int water[maxn], lr[maxn];int main(){    int T;    scanf("%d", &T);    while(T--){        int n, q, l, r;        scanf("%d", &n);        for(int i = 1; i <= n; i++){            scanf("%d", &water[i]);        }        scanf("%d", &q);        for(int i = 0; i < q; i++)        {            scanf("%d %d", &l, &r);            int total = 0;            for(int j = l; j <= r; j++)                lr[total++] = water[j];            sort(lr, lr + total);  //            printf("%d\n", lr[total - 1]);        }    }    return 0;}