CodeForces 5C

Longest Regular Bracket Sequence

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 10^6.

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

Example

Input
)((())))(()())
Output
6 2

Input
))(
Output
0 1

---

题目大意：
找一个括号序列中最大的有意思的子序列。有意义 可以理解为：连续的匹配括号序列。并求出子序列的长度以及个数。

解题思路：
用f[i]表示 前i个字符可以得到的最大有意义的子串长度。
1.用一个栈记录左括号的位置。每次碰到一个右括号就弹出栈顶，即得到最近的一个左括号的位置t。  f[i] = f[t-1] + i-t+1   。这里t-1又是最近的一个左括号前一个字符，如果是一个右括号就将连续的匹配序列连起来了。如果不是右括号，那么f[t-1]值是为0的。正好避免的无意义序列的出现。

---

源代码：

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<algorithm>
#include<vector>
using namespace std;

int n;
char a[1000005];
int  f[1000005] = {0};
int re[2] = {0,1}; 
stack<int> s;

int main(){
    scanf("%s",&a);
    n = strlen(a);
    for(int i=0;i<n;i++){
        if(a[i]=='(')
          s.push(i);
        else{
            if(!s.empty()){
                int t = s.top();
                s.pop();
                f[i] = f[t-1] + i-t+1; 
            }
            if(f[i]>re[0]){
                re[0] = f[i];
                re[1] = 1;
            }else if(f[i]==re[0]){
                re[1]++;
            }
        }
    }
    if(re[0]){
        printf("%d %d",re[0],re[1]);
    }else{
        printf("0 1",re[0],re[1]);
    }

    return 0;
}