1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define N 1000005
char s[N];
int dp[N],ans[N],num = 0,res=0;
using namespace std;
int main(){
    scanf("%s",s);
    int i,len = strlen(s);
    for(i = 0;i<len;i++){
        dp[i] = 0;
        ans[i] = 0;
        if(s[i] == '(')
            num++;
        else{
            if(num>0){
                num--;
                dp[i] = 2;
                ans[i] = 1;
                if(i>0 && s[i-1]==')')
                    dp[i] += dp[i-1];
                if(i-dp[i]>=0){
                    ans[i] += ans[i-dp[i]];
                    dp[i] += dp[i-dp[i]];
                }
            }
        }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX