This is yet another problem dealing with regular bracket sequences.

We should remind you that a bracket sequence is called regular, if by inserting «+» and «1» into it we can get a correct mathematical expression. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not. 

You are given a string of «(» and «)» characters. You are to find its longest substring that is a regular bracket sequence. You are to find the number of such substrings as well.
The first line of the input file contains a non-empty string, consisting of «(» and «)» characters. Its length does not exceed 10<sup class="upper-index">6</sup>.
from collections import deque, defaultdict
s = input()
mp = defaultdict(int)
stack = deque([-1])
_max = 0
for i,c in enumerate(s):
    if c == '(':
        stack.append(i)
    else:
        last = stack.pop()
        if len(stack) == 0:
            stack.append(i)
        else:
            curr =  i - stack[-1]
            if curr > _max:
                _max = curr

            mp[curr] += 1

if _max == 0:
    print(0, 1)
else:
    print(_max, mp[_max])







