Codeforces Round #459 (Div. 2)The Monster[匹配问题]

C. The Monster

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

As Will is stuck in the Upside Down, he can still communicate with his mom, Joyce, through the Christmas lights (he can turn them on and off with his mind). He can't directly tell his mom where he is, because the monster that took him to the Upside Down will know and relocate him.

Thus, he came up with a puzzle to tell his mom his coordinates. His coordinates are the answer to the following problem.

A string consisting only of parentheses ('(' and ')') is called a bracket sequence. Some bracket sequence are called correct bracket sequences. More formally:

• Empty string is a correct bracket sequence.
• if s is a correct bracket sequence, then (s) is also a correct bracket sequence.
• if s and t are correct bracket sequences, then st (concatenation of s and t) is also a correct bracket sequence.

A string consisting of parentheses and question marks ('?') is called pretty if and only if there's a way to replace each question mark with either '(' or ')' such that the resulting string is a non-empty correct bracket sequence.

Will gave his mom a string s consisting of parentheses and question marks (using Morse code through the lights) and his coordinates are the number of pairs of integers (l, r) such that 1 ≤ l ≤ r ≤ |s| and the string slsl + 1... sr is pretty, where si is i-th character of s.

Joyce doesn't know anything about bracket sequences, so she asked for your help.

Input

The first and only line of input contains string s, consisting only of characters '(', ')' and '?' (2 ≤ |s| ≤ 5000).

Output

Print the answer to Will's puzzle in the first and only line of output.

Examples

input

((?))

output

4

input

??()??

output

7

Note

For the first sample testcase, the pretty substrings of s are:

1. "(?" which can be transformed to "()".
2. "?)" which can be transformed to "()".
3. "((?)" which can be transformed to "(())".
4. "(?))" which can be transformed to "(())".

For the second sample testcase, the pretty substrings of s are:

1. "??" which can be transformed to "()".
2. "()".
3. "??()" which can be transformed to "()()".
4. "?()?" which can be transformed to "(())".
5. "??" which can be transformed to "()".
6. "()??" which can be transformed to "()()".
7. "??()??" which can be transformed to "()()()".

题意: 一个串s仅含(    ) ?   , 其中?可以变成 ( 和 )  . 问该串最多能有多少个匹配的长度,使得满足   () , (()) 的情况?

思路:根据数据,明显的O(n^2)

用t表示到当前位置有多少个可用的(  , 用cnt表示到当前位置出现过多少个 ?

1. s[i]=='(',t++;   

    s[i]==')' t--

    s[i]=='?' t--,cnt++

2.if(t==0)正好匹配

   if(t<0 && cnt>0) t+=2,cnt-- 继续匹配

3. if (t<0&& cnt==0) break;后面不可能匹配.

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define bug1 cout <<"bug1"<<endl
#define bug2 cout <<"bug2"<<endl
#define bug3 cout <<"bug3"<<endl
using namespace std;
typedef long long ll;


const int MAX_N=5000+3;
char str[MAX_N];
ll ans;

int main(void){
    scanf("%s",str+1);
    int len=strlen(str+1);
    for(int i=1;i<=len;i++){
        int l=0,cnt=0;
        for(int j=i;j<=len;j++){
            if(str[j]=='(') l++;
            else if(str[j]==')')    l--;
            else  cnt++,l--;
            if(l==0)    ans++;
            else if(l<0&&cnt>0) cnt--,l+=2;
            else if(l>0)    continue;
            else if(l<0&&!cnt)   break;
        }
    }
    cout << ans <<endl;
}