# Range Queries for Longest Correct Bracket Subsequence Set | 2

Given a bracket sequence or in other words a string S of length n, consisting of characters ‘(‘ and ‘)’. Find the length of the maximum correct bracket subsequence of sequence for a given query range. Note: A correct bracket sequence is the one that has matched bracket pairs or which contains another nested correct bracket sequence. For e.g (), (()), ()() are some correct bracket sequence.

Examples:

Input : S = ())(())(())( Start Index of Range = 0, End Index of Range = 11 Output : 10 Explanation: Longest Correct Bracket Subsequence is ()(())(()) Input : S = ())(())(())( Start Index of Range = 1, End Index of Range = 2 Output : 0

**Approach : **In the Previous post (SET 1) we discussed a solution that works in O(long) for each query, now is this post we will going to see a solution that works in O(1) for each query.

Idea is based on the Post length of the longest valid balanced substring If we marked indexes of all Balanced parentheses/bracket in a temporary array (here we named it BCP[], BOP[] ) then we answer each query in O(1) time.

**Algorithm :**

stackis used to get the index of balance bracket. Travese a string from 0 ..to n IF we seen a closing bracket, ( i.e., str[i] = ')' && stack is not empty ) Then mark both "open & close" bracket indexes as 1. BCP[i] = 1; BOP[stk.top()] = 1; And At last, stored cumulative sum of BCP[] & BOP[] Run a loop from 1 to n BOP[i] +=BOP[i-1], BCP[i] +=BCP[i-1]

Now you can answer each query in O(1) time

(BCP[e] - BOP[s-1]])*2;

Below is the implementation of above idea.

`// CPP code to answer the query in constant time ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `/* ` `BOP[] stands for "Balanced open parentheses" ` `BCP[] stands for "Balanced close parentheses" ` ` ` `*/` ` ` `// function for precomputation ` `void` `constructBlanceArray(` `int` `BOP[], ` `int` `BCP[], ` ` ` `char` `* str, ` `int` `n) ` `{ ` ` ` ` ` `// Create a stack and push -1 as initial index to it. ` ` ` `stack<` `int` `> stk; ` ` ` ` ` `// Initialize result ` ` ` `int` `result = 0; ` ` ` ` ` `// Traverse all characters of given string ` ` ` `for` `(` `int` `i = 0; i < n; i++) { ` ` ` `// If opening bracket, push index of it ` ` ` `if` `(str[i] == ` `'('` `) ` ` ` `stk.push(i); ` ` ` ` ` `else` `// If closing bracket, i.e., str[i] = ')' ` ` ` `{ ` ` ` `// If closing bracket, i.e., str[i] = ')' ` ` ` `// && stack is not empty then mark both ` ` ` `// "open & close" bracket indexs as 1 . ` ` ` `// Pop the previous opening bracket's index ` ` ` `if` `(!stk.empty()) { ` ` ` `BCP[i] = 1; ` ` ` `BOP[stk.top()] = 1; ` ` ` `stk.pop(); ` ` ` `} ` ` ` ` ` `// If stack is empty. ` ` ` `else` ` ` `BCP[i] = 0; ` ` ` `} ` ` ` `} ` ` ` ` ` `for` `(` `int` `i = 1; i < n; i++) { ` ` ` `BCP[i] += BCP[i - 1]; ` ` ` `BOP[i] += BOP[i - 1]; ` ` ` `} ` `} ` ` ` `// Function return output of each query in O(1) ` `int` `query(` `int` `BOP[], ` `int` `BCP[], ` ` ` `int` `s, ` `int` `e) ` `{ ` ` ` `if` `(BOP[s - 1] == BOP[s]) { ` ` ` `return` `(BCP[e] - BOP[s]) * 2; ` ` ` `} ` ` ` ` ` `else` `{ ` ` ` `return` `(BCP[e] - BOP[s] + 1) * 2; ` ` ` `} ` `} ` ` ` `// Driver program to test above function ` `int` `main() ` `{ ` ` ` ` ` `char` `str[] = ` `"())(())(())("` `; ` ` ` `int` `n = ` `strlen` `(str); ` ` ` ` ` `int` `BCP[n + 1] = { 0 }; ` ` ` `int` `BOP[n + 1] = { 0 }; ` ` ` ` ` `constructBlanceArray(BOP, BCP, str, n); ` ` ` ` ` `int` `startIndex = 5, endIndex = 11; ` ` ` ` ` `cout << ` `"Maximum Length Correct Bracket"` ` ` `" Subsequence between "` ` ` `<< startIndex << ` `" and "` `<< endIndex << ` `" = "` ` ` `<< query(BOP, BCP, startIndex, endIndex) << endl; ` ` ` ` ` `startIndex = 4, endIndex = 5; ` ` ` `cout << ` `"Maximum Length Correct Bracket"` ` ` `" Subsequence between "` ` ` `<< startIndex << ` `" and "` `<< endIndex << ` `" = "` ` ` `<< query(BOP, BCP, startIndex, endIndex) << endl; ` ` ` ` ` `startIndex = 1, endIndex = 5; ` ` ` `cout << ` `"Maximum Length Correct Bracket"` ` ` `" Subsequence between "` ` ` `<< startIndex << ` `" and "` `<< endIndex << ` `" = "` ` ` `<< query(BOP, BCP, startIndex, endIndex) << endl; ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

Maximum Length Correct Bracket Subsequence between 5 and 11 = 6 Maximum Length Correct Bracket Subsequence between 4 and 5 = 2 Maximum Length Correct Bracket Subsequence between 1 and 5 = 2

**Time complexity for each query is O(1).**

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: **DSA Self Paced**. Become industry ready at a student-friendly price.

## Recommended Posts:

- Range Queries for Longest Correct Bracket Subsequence
- Number of balanced bracket subsequence of length 2 and 4
- Array range queries over range queries
- Queries for elements having values within the range A to B in the given index range using Segment Tree
- Range Queries to count elements lying in a given Range : MO's Algorithm
- Find index of closing bracket for a given opening bracket in an expression
- Check if the bracket sequence can be balanced with at most one change in the position of a bracket | Set 2
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- RGYB(color) Slots Game to guess the correct color for the correct slot
- Longest subsequence with a given AND value
- Longest subsequence with a given AND value | O(N)
- Longest Zig-Zag Subsequence
- Longest subsequence with no 0 after 1
- Longest Increasing Odd Even Subsequence
- Longest subsequence whose average is less than K
- Longest Bitonic Subsequence in O(n log n)
- Longest Consecutive Subsequence
- Longest Increasing Subsequence using BIT
- Longest Increasing Subsequence Size (N log N)
- Longest alternative parity subsequence

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.