RMQSQ - Range Minimum Query

no tags 

You are given a list of numbers and queries. Each query is specified by two numbers and j; the answer to each query is the minimum number between the range [i, j] (inclusive).

Note: the query ranges are specified using 0-based indexing.


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 <= 10,000). The next Q lines each contain two numbers i and which specify a query you must answer (0 <= i, j <= N-1).


For each query, output the answer to that query on its own line in the order the queries were made.


1 4 1
1 1
1 2 Output: 4

hide comments
madhur4127: 2018-02-26 13:45:45

0.01s using sqrt decomposition and segment tree, but 0.02s using sparse table!

Last edit: 2018-02-28 16:06:26
nikolatech: 2018-01-13 00:19:28


Last edit: 2018-05-07 16:41:15
biswajitk123: 2017-12-19 09:59:38

first sqrt decomposition :)

code_aim: 2017-08-25 19:03:24

Using Segment Tree

lostground97: 2017-08-23 16:36:06

AC in one go 0.3 secs ^_^ SQRT Decomposition

Last edit: 2017-08-23 21:51:14
pratham_1: 2017-07-23 15:49:19

AC in one go took 0.59s , <JAVA>[*_*] :)

shashank joshi: 2017-05-26 11:21:17

koi btayega ye code kyun wrong answer de rha hai ?

<1. Don't post any source code here.>

Last edit: 2017-05-26 12:19:42
sonu1801: 2017-05-25 15:52:41

this question can be done in 3 ways(i recommend trying all)
1.square root decomposition(mo's algorithm).(O(n*sqrt(n))
2.sparse table.(O(n)
3.segment tree.O(nlogn).

avidcoder: 2017-04-11 08:04:09

Dynamic programming approach with N^2 preprocessing using 2D array won't work

Randomize: 2016-11-15 11:14:47

solved using modified BIT

Added by:Joshua Kirstein
Time limit:3s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)