RMQSQ  Range Minimum Query
You are given a list of N numbers and Q queries. Each query is specified by two numbers i and j; the answer to each query is the minimum number between the range [i, j] (inclusive).
Note: the query ranges are specified using 0based indexing.
Input
The first line contains N, the number of integers in our list (N <= 100,000). The next line holds N numbers that are guaranteed to fit inside an integer. Following the list is a number Q (Q <= 10,000). The next Q lines each contain two numbers i and j which specify a query you must answer (0 <= i, j <= N1).
Output
For each query, output the answer to that query on its own line in the order the queries were made.
Example
Input: 3
1 4 1
2
1 1
1 2
Output: 4
1
hide comments
fake_death:
20180529 22:15:47
AC 0.01s using sparse table :D 

lamia2658:
20180529 12:08:47
just like water.. range minimum query simply.. :3


elmer_fudd:
20180509 18:57:39
using sqrt decomposition but still run time error.


m2do:
20180425 17:49:05
1. Sparse Table = 0.09 secs...


a_h_k_81:
20180226 22:26:29
Last edit: 20180226 22:26:46 

madhur4127:
20180226 13:45:45
0.01s using sqrt decomposition and segment tree, but 0.02s using sparse table! Last edit: 20180228 16:06:26 

nikolatech:
20180113 00:19:28
[DELETED] Last edit: 20180507 16:41:15 

biswajitk123:
20171219 09:59:38
first sqrt decomposition :) 

code_aim:
20170825 19:03:24
0.01s


lostground97:
20170823 16:36:06
AC in one go 0.3 secs ^_^ SQRT Decomposition Last edit: 20170823 21:51:14 
Added by:  Joshua Kirstein 
Date:  20141018 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 