

Minimum SumTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5333 Accepted Submission(s): 1212 Problem Description You are given N positive integers, denoted as x0, x1 ... xN1. Then give you some intervals [l, r]. For each interval, you need to find a number x to make as small as possible! Input The first line is an integer T (T <= 10), indicating the number of test cases. For each test case, an integer N (1 <= N <= 100,000) comes first. Then comes N positive integers x (1 <= x <= 1,000, 000,000) in the next line. Finally, comes an integer Q (1 <= Q <= 100,000), indicting there are Q queries. Each query consists of two integers l, r (0 <= l <= r < N), meaning the interval you should deal with. Output For the kth test case, first output ¡°Case #k:¡± in a separate line. Then output Q lines, each line is the minimum value of . Output a blank line after every test case. Sample Input
Sample Output
Author standy Source  
