Maximum range length such that A[i] is maximum in given range for all i from [1, N]
Last Updated :
23 Jul, 2025
Given an array arr[] consisting of N distinct integers. For each i (0 ? i < n), find a range [l, r] such that A[i] = max(A[l], A[l+1], ..., A[r]) and l ? i ? r and r-l is maximized.
Examples:
Input: arr[] = {1, 3, 2}
Output: {0 0}, {0 2}, {2 2}
Explanation: For i=0, 1 is maximum in range [0, 0] only. For i=1, 3 is maximum in range [0, 2] and for i = 2, 2 is maximum in range [2, 2] only.
Input: arr[] = {1, 2}
Output: {0, 0}, {0, 1}
Naive Approach: The simplest approach to solve the problem is for each i, Iterate in the range [i+1, N-1] using variable r and iterate in the range [i-1, 0] using the variable l and terminate the loop when arr[l] > arr[i] and arr[r]>arr[i] respectively. The answer will be [l, r].
Time Complexity: O(N×N)
Auxiliary Space: O(1)
Efficient Approach: The above approach can be optimized further by using a stack data structure. Follow the steps below to solve the problem:
- Initialize two vectors, say left and right that will store the left index and right index for each i respectively.
- Initialize a stack of pairs, say s.
- Insert INT_MAX and -1 as a pair in the stack.
- Iterate in the range [0, N-1] using the variable i and perform the following steps:
- While s.top().first<arr[i], pop the top element from the stack.
- Modify the value of left[i] as s.top().second.
- Push {arr[i], i} in the stack.
- Now remove all the elements from the stack.
- Insert INT_MAX and N in the stack as pairs.
- Iterate in the range [N-1, 0] using the variable i and perform the following steps:
- While s.top().first<arr[i], pop the top element from the stack.
- Modify the value of right[i] as s.top().second.
- Push {arr[i], i} in the stack.
- Iterate in the range [0, N-1] using the variable i and print left[i] +1, right[i] -1 as the answer for ith element.
Below is the implementation of the above approach:
C++
// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to find maximum range for
// each i such that arr[i] is max in range
void MaxRange(vector<int> A, int n)
{
// Vector to store the left and right index
// for each i such that left[i]>arr[i]
// and right[i] > arr[i]
vector<int> left(n), right(n);
stack<pair<int, int> > s;
s.push({ INT_MAX, -1 });
// Traverse the array
for (int i = 0; i < n; i++) {
// While s.top().first<a[i]
// remove the top element from
// the stack
while (s.top().first < A[i])
s.pop();
// Modify left[i]
left[i] = s.top().second;
s.push({ A[i], i });
}
// Clear the stack
while (!s.empty())
s.pop();
s.push(make_pair(INT_MAX, n));
// Traverse the array to find
// right[i] for each i
for (int i = n - 1; i >= 0; i--) {
// While s.top().first<a[i]
// remove the top element from
// the stack
while (s.top().first < A[i])
s.pop();
// Modify right[i]
right[i] = s.top().second;
s.push({ A[i], i });
}
// Print the value range for each i
for (int i = 0; i < n; i++) {
cout << left[i] + 1 << ' ' << right[i] - 1 << "\n";
}
}
// Driver Code
int main()
{
// Given Input
vector<int> arr{ 1, 3, 2 };
int n = arr.size();
// Function Call
MaxRange(arr, n);
return 0;
}
//Java program for above approach
import java.awt.*;
import java.util.*;
class GFG{
static class pair<T, V>{
T first;
V second;
}
// Function to find maximum range for
// each i such that arr[i] is max in range
static void MaxRange(ArrayList<Integer> A, int n)
{
// Vector to store the left and right index
// for each i such that left[i]>arr[i]
// and right[i] > arr[i]
int[] left = new int[n];
int[] right = new int[n];
Stack<pair<Integer,Integer>> s = new Stack<>();
pair<Integer,Integer> x = new pair<>();
x.first =Integer.MAX_VALUE;
x.second = -1;
s.push(x);
// Traverse the array
for (int i = 0; i < n; i++)
{
// While s.top().first<a[i]
// remove the top element from
// the stack
while (s.peek().first < A.get(i))
s.pop();
// Modify left[i]
left[i] = s.peek().second;
pair<Integer,Integer> y = new pair<>();
y.first = A.get(i);
y.second = i;
s.push(y);
}
// Clear the stack
while (!s.empty())
s.pop();
pair<Integer,Integer> k = new pair<>();
k.first =Integer.MAX_VALUE;
k.second = n;
s.push(k);
// Traverse the array to find
// right[i] for each i
for (int i = n - 1; i >= 0; i--)
{
// While s.top().first<a[i]
// remove the top element from
// the stack
while (s.peek().first < A.get(i))
s.pop();
// Modify right[i]
right[i] = s.peek().second;
pair<Integer,Integer> y = new pair<>();
y.first = A.get(i);
y.second = i;
s.push(y);
}
// Print the value range for each i
for (int i = 0; i < n; i++) {
System.out.print(left[i]+1);
System.out.print(" ");
System.out.println(right[i]-1);
}
}
// Driver Code
public static void main(String[] args)
{
// Given Input
ArrayList<Integer> arr = new ArrayList<>();
arr.add(1);
arr.add(3);
arr.add(2);
int n = arr.size();
// Function Call
MaxRange(arr, n);
}
}
// This code is contributed by hritikrommie.
# Python 3 program for the above approach
import sys
# Function to find maximum range for
# each i such that arr[i] is max in range
def MaxRange(A, n):
# Vector to store the left and right index
# for each i such that left[i]>arr[i]
# and right[i] > arr[i]
left = [0] * n
right = [0] * n
s = []
s.append((sys.maxsize, -1))
# Traverse the array
for i in range(n):
# While s.top().first<a[i]
# remove the top element from
# the stack
while (s[-1][0] < A[i]):
s.pop()
# Modify left[i]
left[i] = s[-1][1]
s.append((A[i], i))
# Clear the stack
while (len(s) != 0):
s.pop()
s.append((sys.maxsize, n))
# Traverse the array to find
# right[i] for each i
for i in range(n - 1, -1, -1):
# While s.top().first<a[i]
# remove the top element from
# the stack
while (s[-1][0] < A[i]):
s.pop()
# Modify right[i]
right[i] = s[-1][1]
s.append((A[i], i))
# Print the value range for each i
for i in range(n):
print(left[i] + 1, ' ', right[i] - 1)
# Driver Code
if __name__ == "__main__":
# Given Input
arr = [1, 3, 2]
n = len(arr)
# Function Call
MaxRange(arr, n)
# This code is contributed by ukasp.
// C# program for the above approach.
using System;
using System.Collections;
using System.Collections.Generic;
class GFG
{
// Function to find maximum range for
// each i such that arr[i] is max in range
static void MaxRange(List<int> A, int n)
{
// Vector to store the left and right index
// for each i such that left[i]>arr[i]
// and right[i] > arr[i]
int[] left = new int[n];
int[] right = new int[n];
Stack s = new Stack();
s.Push(new Tuple<int, int>(Int32.MaxValue, -1));
// Traverse the array
for (int i = 0; i < n; i++)
{
// While s.top().first<a[i]
// remove the top element from
// the stack
while (((Tuple<int, int>)s.Peek()).Item1 < A[i])
s.Pop();
// Modify left[i]
left[i] = ((Tuple<int, int>)s.Peek()).Item2;
s.Push(new Tuple<int, int>(A[i], i));
}
// Clear the stack
while (s.Count > 0)
s.Pop();
s.Push(new Tuple<int, int>(Int32.MaxValue, n));
// Traverse the array to find
// right[i] for each i
for (int i = n - 1; i >= 0; i--) {
// While s.top().first<a[i]
// remove the top element from
// the stack
while (((Tuple<int, int>)s.Peek()).Item1 < A[i])
s.Pop();
// Modify right[i]
right[i] = ((Tuple<int, int>)s.Peek()).Item2;
s.Push(new Tuple<int, int>(A[i], i));
}
// Print the value range for each i
for (int i = 0; i < n; i++) {
Console.WriteLine((left[i] + 1) + " " + (right[i] - 1));
}
}
static void Main ()
{
List<int> arr = new List<int>();
// adding elements in firstlist
arr.Add(1);
arr.Add(3);
arr.Add(2);
int n = arr.Count;
// Function Call
MaxRange(arr, n);
}
}
// This code is contributed by suresh07.
<script>
// Javascript program for the above approach
// Function to find maximum range for
// each i such that arr[i] is max in range
function MaxRange(A, n)
{
// Vector to store the left and right index
// for each i such that left[i]>arr[i]
// and right[i] > arr[i]
let left = new Array(n).fill(0),
right = new Array(n).fill(0);
let s = [];
s.push([Number.MAX_SAFE_INTEGER, -1]);
// Traverse the array
for(let i = 0; i < n; i++)
{
// While s.top()[0]<a[i]
// remove the top element from
// the stack
while (s[s.length - 1][0] < A[i])
s.pop();
// Modify left[i]
left[i] = s[s.length - 1][1];
s.push([A[i], i]);
}
// Clear the stack
while (s.length)
s.pop();
s.push([Number.MAX_SAFE_INTEGER, n]);
// Traverse the array to find
// right[i] for each i
for(let i = n - 1; i >= 0; i--)
{
// While s.top()[0]<a[i]
// remove the top element from
// the stack
while (s[s.length - 1][0] < A[i])
s.pop();
// Modify right[i]
right[i] = s[s.length - 1][1];
s.push([A[i], i]);
}
// Print the value range for each i
for(let i = 0; i < n; i++)
{
document.write(left[i] + 1 + " ")
document.write(right[i] - 1 + "<br>")
}
}
// Driver Code
// Given Input
let arr = [ 1, 3, 2 ];
let n = arr.length;
// Function Call
MaxRange(arr, n);
// This code is contributed by gfgking
</script>
Time Complexity: O(N)
Auxiliary Space: O(N)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem