No gossip. In this problem I will just say what to do. Initially, you will be given a bracket sequence of length . Then there will be some queries. In each query you will be given two integers , (). You will have to find the maximum length of balanced bracket substring that starts from index and ends not after index . Here substring means a continious sub-part of a string.
In the first line there will be an integer (). Then there will be a string of length containing only characters '(' or ')'. In next line there will be an integer () indicating the number of queries. Then each of the lines will contain two integers and () as described in statement.
For each query print the maximum length of continuous bracket sequence that is balanced and starts from index and ends not after index .
10 ()(())())( 5 1 9 1 1 1 2 9 10 2 5
8 0 2 0 0
You can learn more about balanced bracket sequence from here.