51nod1478(yy)

题目链接: http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1478&judgeId=365133　　

题意: 中文题诶~

思路: 令左括号的值为 1, 右括号的值为 -1, 然后再用前缀i和搞一下就好了.

代码:

 #include <iostream>
 using namespace std;

 const int MAXN = 1e6 + ;
 int vis[MAXN], tag[MAXN];

 int main(void){
     string s;
     cin >> s;
     for(int i = ; i < s.size(); i++){
         if(s[i] == '(') vis[i] = ;
         else vis[i] = -;
     }
     int sol = , i = ;
     while(i < s.size()){
         int cnt = ;
         for(int j = i; j < s.size(); j++){
             cnt += vis[j];
             if(cnt == ){
                 sol = max(sol, j - i + );
                 tag[j - i + ]++;
             }else if(cnt < ){
                 i = j;
                 break;
             }
         }
         i++;
     }
     cout << sol << " " << (tag[sol] ==  ?  : tag[sol]) << endl;
     return ;
 }