The Water Problem(排序)

时间:2022-07-08 00:50:24

The Water Problem

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

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 aThe Water Problem(排序)1The Water Problem(排序),aThe Water Problem(排序)2The Water Problem(排序),aThe Water Problem(排序)3The Water Problem(排序),...,aThe Water Problem(排序)nThe Water Problem(排序)The Water Problem(排序) representing the size of the water source. Given a set of queries each containing 2The Water Problem(排序) integers lThe Water Problem(排序) and rThe Water Problem(排序), please find out the biggest water source between aThe Water Problem(排序)lThe Water Problem(排序)The Water Problem(排序) and aThe Water Problem(排序)rThe Water Problem(排序)The Water Problem(排序).
 
Input
First you are given an integer T(T≤10)The Water Problem(排序) indicating the number of test cases. For each test case, there is a number n(0≤n≤1000)The Water Problem(排序) on a line representing the number of water sources. nThe Water Problem(排序) integers follow, respectively aThe Water Problem(排序)1The Water Problem(排序),aThe Water Problem(排序)2The Water Problem(排序),aThe Water Problem(排序)3The Water Problem(排序),...,aThe Water Problem(排序)nThe Water Problem(排序)The Water Problem(排序), and each integer is in {1,...,10The Water Problem(排序)6The Water Problem(排序)}The Water Problem(排序). On the next line, there is a number q(0≤q≤1000)The Water Problem(排序) representing the number of queries. After that, there will be qThe Water Problem(排序) lines with two integers lThe Water Problem(排序) and r(1≤l≤r≤n)The Water Problem(排序) 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
代码:
 #include<stdio.h>
#include<stdlib.h>
#include<string.h>
const int MAXN=;
int cmp(const void *a,const void *b){
if(*(int *)a<*(int *)b)return ;
else return -;
}
int main(){
int m[MAXN],T,N,q,l,r,n[MAXN];
scanf("%d",&T);
while(T--){
scanf("%d",&N);
for(int i=;i<=N;i++)
scanf("%d",m+i),n[i]=m[i];
scanf("%d",&q);
while(q--){
scanf("%d%d",&l,&r);
for(int i=;i<=N;i++)
m[i]=n[i];
qsort(m+l,r-l+,sizeof(m[]),cmp);
printf("%d\n",m[l]);
}
}
return ;
}