Codeforces Round #459 (Div. 1) 思维

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

Copy

((?))

output

4

input

Copy

??()??

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

题意：给定一个含有' ( ' , ' ) ' , ' ? '三种符号的字符串，其中'?'可以变为任意一种括号，求共有多少子串满足括号匹配。

思路：从左到右以每一个字符为子串的起始开始遍历。定义一个变量 l 用以统计左括号的数量。当符号为左括号时，l++；当符号为右括号时，l--；当符号为问号时，可以先将其当做右括号，并记录下问号的个数，当左括号不够用时，将原先当做右括号的问号变为左括号（详见代码）。在遍历过程中，当l==0时，则以某个字符为开始的子串出现括号匹配，答案+1；当l<0时，若存在问号，则将问号变为左括号再进行判断，若不存在括号，则右括号数大于左括号，括号失配，跳过当前循环并开始下一轮循环。

代码如下：

#include <bits/stdc++.h>
using namespace std;

char s[5100];

int main()
{
    while (~scanf("%s",s)){
        int len=strlen(s);
        int ans=0;
        for (int i=0;i<len-1;i++){
            int cnt=0,l=0;      //l记录左括号数，cnt记录问号数
            for (int j=i;j<len;j++){
                if (s[j]=='(')
                    l++;
                else if (s[j]==')')
                    l--;
                else{       //先将问号当做右括号
                    l--;
                    cnt++;
                }
                if (l==0)       //出现括号匹配
                    ans++;
                else if (l<0&&cnt>0){       //当左括号不够用时，将原先当做右括号的问号变为左括号
                    cnt--;
                    l+=2;
                }
                else if (l<0&&cnt<=0)       //括号失配
                    break;

            }

        }
        printf("%d\n",ans);
    }
    return 0;
}