# CF5C Longest Regular Bracket Sequence

• 118通过
• 293提交
• 题目来源
• 评测方式 RemoteJudge
• 标签 动态规划,动规,dp 字符串
• 难度 提高+/省选-
• 时空限制 2000ms / 256MB
• 提示：收藏到任务计划后，可在首页查看。

## 题意翻译

给出一个括号序列，求出最长合法子串和它的数量。 合法的定义：这个序列中左右括号匹配

## 题目描述

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^{6}$ .

输出格式：

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".

## 输入输出样例

输入样例#1： 复制
)((())))(()())

输出样例#1： 复制
6 2

输入样例#2： 复制
))(

输出样例#2： 复制
0 1

提示
标程仅供做题后或实在无思路时参考。
请自觉、自律地使用该功能并请对自己的学习负责。
如果发现恶意抄袭标程，将按照I类违反进行处理。