跳至正文
题库1827
#1827

Longest Regular Bracket Sequence

    ID: 1827 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 6 上传者: 标签>Codeforces动态规划贪心数据结构字符串
查看题目操作

Longest Regular Bracket Sequence

题目描述

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.

Input

The first line of the input file contains a non-empty string, consisting of «(» and «)» characters. Its length does not exceed 106.

Output

Print the length of the longest substring that is a regular bracket sequence, and the number of such substrings. If there are no such substrings, write the only line containing "0 1".

Examples

)((())))(()())
6 2
))(
0 1