Preparing NOJ

Longest Regular Bracket Sequence

2000ms 262144K

Description:

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

Sample Input:

)((())))(()())

Sample Output:

6 2

Sample Input:

))(

Sample Output:

0 1

Info

Provider CodeForces

Origin Codeforces Beta Round #5

Code CF5C

Tags

constructive algorithmsdata structuresdpgreedysortingsstrings

Submitted 42

Passed 13

AC Rate 30.95%

Date 03/03/2019 18:44:40

Related

Nothing Yet