CodeForces - 918C The Monster （暴力）_codeforces

通过解读Will发送给Joyce的特殊字符串，寻找隐藏坐标。挑战在于解析由括号及问号组成的字符串，找出所有可转化为有效括号序列的子串。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

$\text{[math]}$

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:

"(?" which can be transformed to "()".
"?)" which can be transformed to "()".
"((?)" which can be transformed to "(())".
"(?))" which can be transformed to "(())".

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

"??" which can be transformed to "()".
"()".
"??()" which can be transformed to "()()".
"?()?" which can be transformed to "(())".
"??" which can be transformed to "()".
"()??" which can be transformed to "()()".
"??()??" which can be transformed to "()()()".

题意：看note即可。

解题思路：考虑暴力的做法，枚举所有区间，可能要N^3复杂度，但是我们可以边枚举边计算，复杂度降为N^2，怎么算呢？对于每一个区间[i,j]，要使[i,j]成立，那么在你从i往j扫的时候，必须每一步都是成立的，意思就是左括号数量要大于右括号的数量。根据这个来判断是否成立即可。详见代码。

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <memory.h>

using namespace std;


int main()
{
    string a;
    cin>>a;
    int ans=0;
    for(int i=0;i<a.length();i++){
        int l=0,r=0;//左括号的数量跟?的数量

        for(int j=i;j<a.length();j++){
            if(a[j]=='(')
                l++;
            else if(a[j]==')')
                l--;//相当于跟一个左括号抵消
            else{
                l--;//暂时把?当成右括号，跟左括号抵消。
                r++;
            }

            if(l==0)
                ans++;//当前区间成功匹配

            if(l<0){
                if(r==0)//如果没有?，那么在这之后的所有区间，肯定都不成立
                    break;
                else{
                    if(r>0){
                        l+=2;//把?重新当成左括号来匹配掉右括号
                        r--;
                    }
                }
            }
        }
    }
    cout<<ans<<endl;


    return 0;

}